kernel/src/runtime/BinarySearchTree.h
/**
         * Returns the minimum node in a given subtree. This simply keeps going down the left
         * subtree of a particular node until we reach the end.
         *
         * @param node Subtree to find the minimum value in
         *
         * @return Tree node corresponding to the minimum value in the given subtree
         */
Returns the minimum node in a given subtree. This simply keeps going down the left
subtree of a particular node until we reach the end.

@param node Subtree to find the minimum value in

@return Tree node corresponding to the minimum value in the given subtree
Returns the minimum node in a given subtree . This simply keeps going down the left subtree of a particular node until we reach the end . @param node Subtree to find the minimum value in @return Tree node corresponding to the minimum value in the given subtree
Leaf *findMin(Leaf *node) {
            if(!node) return nullptr;
            if(node->left) return this->findMin(node->left);
            else return node;
        }
Leaf * findMin ( Leaf * node ) { if ( ! node ) return nullptr ; if ( node -> left ) return this -> findMin ( node -> left ) ; else return node ; }
Returns the minimum node in a given subtree.
Returns the minimum node in a given subtree .