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

1 vote234 views4 answers
How to use string in c++
C++
1 vote218 views1 answer
Esp32 restart from code
C++
0 vote234 views1 answer
Adddynamic ue4 c++
C++
9 votes194 views4 answers
C++ sqrt
C++
0 vote247 views1 answer
Backward chaining python
C++
0 vote210 views1 answer
130 divided by -10
C++
0 vote231 views1 answer
C++ vector allocator example
C++
0 vote223 views1 answer
Ampersand in cpp
C++
0 vote222 views1 answer
What type is this c++
C++
0 vote236 views1 answer
How to change colour image to grey in opencv c++
C++