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

2 votes119 views1 answer
How to use string variable in switch case in c++
C++
0 vote131 views1 answer
Fast scan in c++
C++
5 votes160 views3 answers
Fast io c++
C++
2 votes114 views1 answer
Get type of an object c++
C++
16 votes122 views6 answers
Sort vector c++
C++
0 vote116 views1 answer
Size of a matrix c++
C++
30 votes136 views5 answers
Remove value from vector c++
C++
0 vote131 views1 answer
Swap first and last character of string in c++
C++
19 votes138 views3 answers
File reading c++
C++
4 votes122 views2 answers
C++ inline if
C++