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 vote219 views1 answer
C++ suare
C++
0 vote200 views1 answer
Binary search c++
C++
0 vote195 views1 answer
Flutter text direction auto
C++
5 votes172 views2 answers
Variables in c++
C++
3 votes224 views2 answers
Define and show the implementation of the functions of an arrayList.
C++
3 votes205 views1 answer
Initialzing a 2d vector in cpp
C++
0 vote202 views1 answer
Who made c++
C++
2 votes228 views3 answers
Cpp online compiler
C++
8 votes215 views3 answers
Stack implementation using class in c++
C++
1 vote221 views1 answer
Qt qchar to char
C++