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

3 votes247 views1 answer
Differentialble programming
C++
-1 vote249 views1 answer
React cookie
C++
2 votes233 views1 answer
C++ print current time
C++
2 votes234 views1 answer
Unordered_map of pair and int
C++
0 vote243 views1 answer
Cpp get keystroke in console only
C++
0 vote243 views1 answer
How to change the value of a key in hashmp in c++
C++
0 vote243 views1 answer
C++ main function parameters
C++
5 votes229 views2 answers
Conditional operator in cpp
C++
1 vote258 views1 answer
Avrational compare
C++
0 vote240 views1 answer
C++ cout colored output xcode
C++