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

14 votes309 views1 answer
Dynamically generating 2d array in cpp
C++
2 votes369 views2 answers
Array and for loop in c++
C++
0 vote374 views1 answer
C++ load file as vector
C++
0 vote318 views1 answer
Opencv c++ feature detection
C++
1 vote316 views1 answer
How to print fixed places after decimal point in c++
C++
20 votes381 views3 answers
How to append to a vector c++
C++
22 votes331 views18 answers
Pointers in c++
C++
0 vote318 views1 answer
How to pronounce beaucoup
C++
1 vote351 views1 answer
Can you chnage the address of a pointer
C++
0 vote371 views1 answer
Print duplicate characters from string in c++
C++