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

4 votes256 views1 answer
How to delete a 2d dynamic array in c++
C++
1 vote159 views1 answer
Iterating string in cpp
C++
0 vote167 views1 answer
Max two numbers c++
C++
1 vote158 views1 answer
Convert whole string to lowercase c++
C++
9 votes150 views1 answer
C++ code to print hello world
C++
15 votes160 views2 answers
Calculate factorial
C++
0 vote176 views3 answers
Online convert c++ code to assembly language
C++
6 votes176 views1 answer
How to initialize array with new in c++
C++
0 vote176 views1 answer
Fast scan in c++
C++
16 votes213 views5 answers
Sort array c++
C++