kernel/src/runtime/BinarySearchTree.h
/**
         * Returns the successor, i.e. the next key in the sorted order, to the given node.
         *
         * @param node Node whose successor to find
         *
         * @return Successor to the given node
         */


@return Successor to the given node
@return Successor to the given node
Leaf *findSuccessor(Leaf *node) {
            if(node->right) {
                return this->findMin(node->right);
            }
            return nullptr;
        }
Leaf * findSuccessor ( Leaf * node ) { if ( node -> right ) { return this -> findMin ( node -> right ) ; } return nullptr ; }
Returns the successor, i.e.
Returns the successor i . e .