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

1 vote158 views1 answer
Compile multiple files C++ linux
C++
7 votes143 views1 answer
Migration meaning
C++
2 votes167 views2 answers
Array and for loop in c++
C++
13 votes147 views5 answers
Max of a vector c++
C++
0 vote147 views1 answer
Transform cpp
C++
0 vote141 views1 answer
How to use mersenne_twister_engine in c++ to generate random numbers
C++
0 vote160 views1 answer
How to do if command in c++
C++
1 vote164 views1 answer
Get ascii value of qchar
C++
32 votes179 views3 answers
Remove specific element from vector c++
C++
16 votes156 views3 answers
Console clear c+
C++