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

5 votes176 views2 answers
Sleep c++ windows
C++
0 vote170 views1 answer
Run program until ctrl-d c++
C++
1 vote183 views1 answer
HOW TO TURN LINK TO BUTTON IN MVC
C++
0 vote191 views1 answer
Functors in c++
C++
0 vote194 views1 answer
If not c++
C++
0 vote172 views1 answer
How to merge string array in C++
C++
0 vote201 views1 answer
Request for member ‘push_back’ in ‘matrix’, which is of non-class type ‘std::vector<int>()’
C++
1 vote206 views1 answer
G++ -wall option meaning
C++
22 votes382 views2 answers
DateFormat in Flutter
C++
0 vote193 views1 answer
Remove element from c++
C++