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 vote106 views1 answer
Disallowcopy c++
C++
0 vote127 views1 answer
Move mouse c++
C++
0 vote116 views1 answer
C++ lettura file
C++
0 vote119 views1 answer
Create matrix cpp
C++
2 votes105 views1 answer
Rng c++
C++
0 vote110 views1 answer
Platform io change baud rate
C++
23 votes119 views6 answers
String to char
C++
4 votes113 views3 answers
REFERENCE C++
C++
1 vote120 views1 answer
File descriptor linux c++
C++
-1 vote125 views2 answers
Why is my unity crashing
C++