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 vote122 views1 answer
C++ map lookup
C++
2 votes127 views4 answers
Bubble Sort
C++
0 vote141 views1 answer
Add comment in c/c++
C++
18 votes133 views5 answers
How to clear console c++
C++
0 vote129 views1 answer
Are arrays faster than vectors c++
C++
1 vote131 views3 answers
Return use in c++
C++
-2 votes135 views1 answer
C++ constant
C++
19 votes158 views1 answer
File handling in c++
C++
1 vote134 views1 answer
How to print in new lines in C++
C++
0 vote128 views1 answer
Std::cout and cout
C++