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 vote107 views1 answer
2d array of zeros c++
C++
-1 vote97 views1 answer
How to parse using stringstream
C++
0 vote107 views3 answers
Options select from array
C++
5 votes109 views1 answer
Initialize vector to all zeros c++
C++
0 vote100 views1 answer
Write C++ program that will ask to choose from three cases.
C++
0 vote121 views1 answer
Print each number of digit c++
C++
0 vote100 views1 answer
Balanced brackets hackerrank solution c++
C++
0 vote108 views1 answer
Temporary file using MSFT API in cpp
C++
0 vote130 views1 answer
C++ move second line
C++
0 vote135 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++