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

2 votes347 views1 answer
Get elements of tuple c++
C++
0 vote340 views1 answer
Get first and last character of string c++
C++
17 votes350 views4 answers
How to reference a child gameobject unity
C++
1 vote325 views1 answer
Linerenderer follow camera unity
C++
0 vote310 views1 answer
Translation codeforces in c++
C++
1 vote341 views1 answer
Google spreadsheets add two strings
C++
1 vote319 views1 answer
Integer type validation c++
C++
2 votes337 views1 answer
How to create a structure c++
C++
7 votes330 views1 answer
How to check string contains char in c++
C++
0 vote294 views1 answer
Interest rate parity
C++