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

2 votes201 views1 answer
Check if a string is palindrome cpp
C++
-1 vote178 views2 answers
Casting cpp
C++
1 vote168 views3 answers
How to get a random number between two numbers in c++
C++
9 votes202 views2 answers
C++ remove last element from array
C++
0 vote184 views1 answer
Dream speedrun music free download mp3
C++
0 vote178 views1 answer
C++ optimize big int array
C++
7 votes159 views2 answers
Min heap stl
C++
7 votes168 views5 answers
Stack in c++
C++
15 votes184 views6 answers
Factorial
C++
0 vote162 views1 answer
\frac{2}{5}MR^2 typed in c++
C++