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

1 vote225 views1 answer
Tarray ue4 c++
C++
0 vote302 views1 answer
Esp8266 wifi.localip() to string
C++
3 votes220 views2 answers
C++ round number to whole
C++
1 vote517 views1 answer
C++ vector structure
C++
2 votes188 views1 answer
How to make crypto
C++
0 vote172 views1 answer
Flutter text direction auto
C++
0 vote193 views1 answer
Equals operator c++ overlaod
C++
0 vote184 views1 answer
Detect end of user input cpp
C++
0 vote209 views10 answers
Online compiler c++ with big O calculator
C++
0 vote170 views1 answer
How to slice vector in c++
C++