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 vote144 views1 answer
Sieve of eresthossis cp c++
C++
0 vote176 views1 answer
C++ Calculating the Mode of a Sorted Array
C++
37 votes190 views2 answers
Remove element by index from vector c++
C++
0 vote161 views2 answers
Function prototype c++
C++
3 votes157 views1 answer
How i say hello world in c++
C++
0 vote143 views1 answer
Haxelib install cpp
C++
0 vote161 views1 answer
How to do if command in c++
C++
0 vote146 views1 answer
Turbo c++ easy programs
C++
1 vote157 views1 answer
How to print fixed places after decimal point in c++
C++
1 vote143 views1 answer
Iterating string in cpp
C++