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

0 vote115 views1 answer
How to get window size sfml
C++
1 vote119 views1 answer
Differency between c++ std and stl
C++
1 vote122 views1 answer
OPA in expanse
C++
12 votes142 views4 answers
Sort function descending c++
C++
0 vote119 views1 answer
Ordine crescente di numeri indefiniti in c++
C++
1 vote125 views1 answer
String to vector c++
C++
1 vote125 views1 answer
C++ overwrite file
C++
0 vote116 views1 answer
Find N Unique Integers Sum Up to Zero
C++
-1 vote120 views2 answers
Function template c++
C++
10 votes169 views4 answers
Toupper c++
C++