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 vote122 views1 answer
Choose endianness in cpp
C++
8 votes128 views1 answer
Remove last letter in string c++
C++
0 vote120 views1 answer
Use uint in c++
C++
10 votes124 views3 answers
Remove last character from string c++
C++
0 vote111 views1 answer
Get type of variable in c++
C++
0 vote127 views1 answer
Use of strstr in c++
C++
0 vote120 views1 answer
C++ measure time in microseconds
C++
0 vote117 views1 answer
How to generate number in c++
C++
0 vote121 views1 answer
Sum of first 100 natural numbers
C++
23 votes124 views6 answers
String to char
C++