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

14 votes317 views4 answers
Converting to string c++
C++
2 votes303 views2 answers
How to get cursor position c++
C++
1 vote301 views1 answer
G++ -wall option meaning
C++
0 vote308 views1 answer
Get rest of a stringstream c++
C++
2 votes284 views1 answer
Replace a char in string c++ at a specific index
C++
0 vote317 views1 answer
C++ put a function in a other thread
C++
0 vote294 views1 answer
How to show constellations in starry night orion special edition
C++
0 vote312 views1 answer
What is the "-->" operator in C/C++?
C++
1 vote312 views1 answer
Prime number generator c++
C++
0 vote287 views1 answer
How to move your chrector in unity
C++