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

0 vote194 views1 answer
C++ recorrer string
C++
1 vote200 views1 answer
Cpp vector structure
C++
0 vote208 views1 answer
C++ cout update percentage
C++
1 vote201 views1 answer
How to return 2d array from function c++
C++
11 votes211 views2 answers
Str remove char c++
C++
1 vote200 views1 answer
How to put bitset into a string in c++
C++
1 vote187 views1 answer
Ue4 find component c++
C++
35 votes223 views3 answers
Hello c++
C++
0 vote186 views1 answer
Cyclic array rotation in cpp
C++
0 vote202 views1 answer
Memset array bool
C++