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 vote340 views2 answers
Round all columns in R dataframe to 3 digits
C++
4 votes316 views1 answer
How to compare lower case character to uppercase cpp
C++
0 vote331 views1 answer
I++ and++i
C++
2 votes308 views1 answer
Endl in c++ means
C++
0 vote332 views1 answer
C++counter
C++
0 vote331 views1 answer
Cpp console progressbar
C++
0 vote405 views1 answer
Virtual function c++
C++
0 vote338 views1 answer
Fenwick tree
C++
14 votes336 views4 answers
Converting to string c++
C++
0 vote324 views1 answer
Implicit conversion casting
C++