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 vote188 views1 answer
Ue4 execute delegate from blueprint
C++
0 vote200 views1 answer
Hola mundo c++
C++
0 vote197 views1 answer
Deifine an object in C++
C++
0 vote174 views1 answer
Char vector to string c++
C++
1 vote188 views1 answer
Swap using Function template in c++
C++
34 votes232 views6 answers
C++ string to int
C++
0 vote182 views2 answers
C++ program to convert celsius to fahrenheit
C++
2 votes201 views1 answer
C++ primality test
C++
-4 votes330 views2 answers
Unreal engine
C++
0 vote200 views1 answer
C++ do every 1 minutes
C++