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

10 votes312 views4 answers
Toupper c++
C++
0 vote282 views1 answer
Use ster when declaring variables cpp
C++
0 vote281 views1 answer
Convert char to C
C++
0 vote282 views1 answer
C++ how to skip the last element of vector
C++
2 votes255 views3 answers
How to find length of character array in c++
C++
1 vote284 views1 answer
Leveling system c++
C++
-1 vote225 views1 answer
Identity
C++
0 vote261 views1 answer
SET TO NULL pointer c++
C++
1 vote266 views1 answer
Concurrency in c++
C++
0 vote289 views1 answer
Insertion overloading in c++
C++