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 vote103 views1 answer
Langestpalindromicsubsequence(dp)
C++
326 votes236 views3 answers
How to remove to an Array
C++
2 votes104 views2 answers
How to check a number in string
C++
0 vote91 views2 answers
Add variable to legend matlab
C++
0 vote104 views1 answer
Cpp map contains
C++
15 votes93 views4 answers
C++ vector
C++
0 vote98 views1 answer
Smooth Poti values on Arduino
C++
0 vote69 views2 answers
Vector to string c++
C++
0 vote91 views1 answer
Insertion overloading in c++
C++
0 vote147 views1 answer
Opencv compile c++
C++