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 vote134 views1 answer
C++ file handiling
C++
5 votes149 views6 answers
While loop in c++
C++
1 vote159 views1 answer
Arduino notone
C++
5 votes140 views1 answer
Cpp all in one header
C++
0 vote134 views1 answer
C++ split string by several space
C++
0 vote135 views1 answer
PI IN C++ WITH CMATH
C++
0 vote175 views1 answer
How to analyse a poem
C++
6 votes137 views2 answers
Precision c++
C++
3 votes141 views1 answer
Swap values in array c++
C++
3 votes124 views1 answer
Convert refference to pointer c++
C++