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

13 votes123 views27 answers
Cpp hello
C++
1 vote139 views1 answer
C++ code for bubble sort
C++
19 votes149 views1 answer
How to load from files C++
C++
0 vote160 views1 answer
Escribir texto c++
C++
0 vote137 views1 answer
Size of a matrix c++
C++
0 vote150 views1 answer
Prime factorisation of a number in c++
C++
0 vote138 views1 answer
Not c++
C++
0 vote162 views1 answer
Cocos2d c++ linux
C++
1 vote139 views1 answer
Start with pure c++ and opengl gamedev
C++
0 vote145 views1 answer
How to get a word from file c++
C++