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 vote131 views2 answers
C++ code
C++
1 vote128 views1 answer
How to add colored text in c++
C++
0 vote135 views1 answer
Flowchart to display factors of a number
C++
0 vote117 views1 answer
Variadic template constructor matches better than copy constructor
C++
1 vote124 views1 answer
Whole size of the internet
C++
0 vote132 views1 answer
C++ capture screen as pixel array
C++
0 vote131 views1 answer
Is there garbage collection in c++
C++
0 vote126 views1 answer
C++ cout iostream
C++
0 vote194 views1 answer
Fast input and output c++
C++
1 vote162 views1 answer
Prime number generator c++
C++