Find height of a tree

Height of a binary tree

int height(Node* root)
{
    // Base case: empty tree has height 0
    if (root == nullptr)
        return 0;
 
    // recur for left and right subtree and consider maximum depth
    return 1 + max(height(root->left), height(root->right));
}

Source: techiedelight.com

Find height of a tree

// finding height of a binary tree in c++.
int maxDepth(node* node)  
{  
    if (node == NULL)  
        return 0;  
    else
    {  
        /* compute the depth of each subtree */
        int lDepth = maxDepth(node->left);  
        int rDepth = maxDepth(node->right);  
      
        /* use the larger one */
        if (lDepth > rDepth)  
            return(lDepth + 1);  
        else return(rDepth + 1);  
    }  
}

Similar codes

0 vote226 views1 answer
Cosnt cast
C++
0 vote184 views1 answer
C plus plus hello world
C++
0 vote204 views1 answer
String hash
C++
0 vote222 views1 answer
#include <iostream> using namespace std; int main(){ int sum1 = 100+50; int sum2 = sum1+250; int sum3 = sum2+sum2; cout<< sum1 << "\n"; cout<< sum2 << "\n"; cout<< sum3 << "\n";
C++
4 votes221 views2 answers
Round double to n decimal places c++
C++
0 vote226 views1 answer
Why ostream cannot be constant
C++
2 votes219 views2 answers
Strlen in c++
C++
3 votes214 views2 answers
Convert binary string to int c++
C++
1 vote233 views1 answer
Leveling system c++
C++
0 vote235 views1 answer
Convert Celsius to Fahrenheit
C++