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 vote295 views4 answers
How to modify 2d array in function c++
C++
2 votes283 views1 answer
Suppress individual warnings in visual c++
C++
0 vote307 views1 answer
How to concatenate two vectors in c++
C++
-1 vote303 views1 answer
Fast way to check if a number is prime C++
C++
2 votes283 views2 answers
Selection sort c++ algorithm
C++
0 vote298 views1 answer
Implicit conversion casting
C++
2 votes283 views1 answer
Cannot find "-lsqlite3" C++
C++
0 vote289 views1 answer
Kmp c++
C++
0 vote267 views1 answer
C code to c++ converter
C++
0 vote310 views1 answer
Hamming c++
C++