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 vote91 views1 answer
Case 1 or 2 c++
C++
6 votes105 views1 answer
C++ call static method
C++
0 vote127 views1 answer
How to turn an integer variable into a char c++
C++
0 vote139 views1 answer
C++ do every 1 minutes
C++
1 vote164 views1 answer
C++ char define
C++
0 vote139 views1 answer
All in one c++
C++
7 votes136 views2 answers
Include all libraries in c++
C++
0 vote162 views1 answer
How to pass std::array with unknown size to function C++
C++
0 vote127 views1 answer
C++ enum rand
C++
0 vote150 views1 answer
How to type a vertical stack program c++
C++