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 vote171 views1 answer
Swap of two numbers in c++
C++
7 votes187 views3 answers
C++ replace
C++
-3 votes211 views1 answer
Array c plus plus
C++
1 vote180 views1 answer
Dev c++ tahe last word error
C++
0 vote173 views1 answer
How to take full sentence in c++
C++
-1 vote168 views2 answers
Run cpp code
C++
27 votes220 views2 answers
How to remove an element from a vector by value c++
C++
0 vote193 views1 answer
Sort using lambda c++
C++
5 votes194 views2 answers
Vbs check if file exists
C++
0 vote199 views2 answers
How can we create 4 digit random number in c++
C++