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 vote152 views1 answer
How to run a msi file raspbrain
C++
-1 vote116 views1 answer
How to array in c++
C++
0 vote138 views1 answer
Print elements of linked list
C++
1 vote141 views1 answer
C++ delete directory
C++
4 votes145 views1 answer
Gcd of two numbers c++
C++
0 vote121 views1 answer
Generate random ints and floats
C++
0 vote137 views1 answer
What is imposter syndrome
C++
0 vote134 views1 answer
CamelCase Problem
C++
0 vote166 views1 answer
Rotate an array of n elements to the right by k steps
C++
5 votes125 views1 answer
How to use comparator funtion in priority queue in c++
C++