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 vote246 views1 answer
Plus (programming language)
C++
8 votes217 views1 answer
How to print every element of the array in cpp
C++
0 vote242 views1 answer
Cuda locks
C++
0 vote245 views1 answer
Glew32.dll was not found
C++
0 vote206 views1 answer
Interest rate parity
C++
1 vote235 views1 answer
C++ code for bubble sort
C++
1 vote257 views1 answer
How to round to nearest whole number unity
C++
1 vote266 views1 answer
How to substract to give a positive outcome in c++
C++
0 vote243 views1 answer
Min element in stl c++
C++
2 votes241 views2 answers
Selection sort c++ algorithm
C++