Height of bst cpp

// Find height of a tree, defined by the root node
int tree_height(Node* root) {
    if (root == NULL) 
        return 0;
    else {
        // Find the height of left, right subtrees
        left_height = tree_height(root->left);
        right_height = tree_height(root->right);
          
        // Find max(subtree_height) + 1 to get the height of the tree
        return max(left_height, right_height) + 1;
}

Similar codes

-1 vote151 views1 answer
Template function in class c++
C++
0 vote158 views1 answer
Pointer address to string
C++
0 vote185 views1 answer
Sort html elements in Jquery on condition
C++
1 vote164 views1 answer
Sfml mouse click
C++
-1 vote165 views1 answer
Fast way to check if a number is prime C++
C++
20 votes133 views10 answers
Prime number c++
C++
0 vote193 views1 answer
Pimpl c++
C++
0 vote158 views1 answer
C++ loop trhought object
C++
1 vote163 views1 answer
Pyramid shape in c++
C++
0 vote159 views1 answer
Windows servis from console app
C++