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

22 votes300 views4 answers
Height of the tree
C++
0 vote306 views1 answer
Delete heap array c
C++
0 vote300 views1 answer
Binary algebra cpp
C++
0 vote331 views1 answer
Sprintf add two xeroes for a float number
C++
1 vote301 views1 answer
Matrix layout in C++
C++
0 vote621 views1 answer
Sfml hide message
C++
0 vote297 views3 answers
If
C++
0 vote298 views1 answer
C++ expected an identifier
C++
0 vote352 views1 answer
Array copx c++
C++
2 votes326 views1 answer
C++ custom compare in set
C++