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 vote313 views1 answer
C++ include a file in another directory
C++
0 vote337 views1 answer
_ZNSolsEi
C++
2 votes383 views2 answers
Palindrome checker in c++
C++
6 votes348 views4 answers
Map c++
C++
0 vote366 views2 answers
Basic Makefile C++
C++
1 vote355 views1 answer
Splice string in c++
C++
0 vote333 views1 answer
C++ conditional typedef
C++
0 vote359 views1 answer
How many months have 31 days
C++
0 vote312 views1 answer
C++ handling
C++
0 vote371 views1 answer
Take pieces of a string in c++
C++