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

26 votes231 views2 answers
Remove element from vector on condition c++
C++
3 votes167 views1 answer
Map declaration c++
C++
0 vote180 views1 answer
Find the biggest element in the array
C++
-2 votes165 views1 answer
Computer vision libraries C++
C++
1 vote173 views1 answer
Ifstream relative file path
C++
0 vote163 views1 answer
Five
C++
0 vote154 views1 answer
C++ fstream create if not exists
C++
1 vote125 views1 answer
Arduino funktion
C++
0 vote230 views1 answer
C++ construnctor
C++
0 vote154 views1 answer
Sinh nhi phan c++
C++