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 vote105 views1 answer
Cpp print variable value
C++
4 votes113 views1 answer
Sort vector struct c++
C++
2 votes98 views1 answer
C++ virtual function in constructor
C++
0 vote100 views1 answer
Wgat is duble in c++
C++
0 vote65 views1 answer
Visual studio code terminal keeps closing c++
C++
1 vote99 views1 answer
Il2cpp unity stuck c#
C++
0 vote108 views1 answer
What is the format specifier for dword c++
C++
0 vote97 views1 answer
Vector of threads thread pool c++
C++
2 votes97 views3 answers
C++ lambda
C++
4 votes103 views2 answers
Double max value c++
C++