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 vote162 views1 answer
Remove a element from an array c++
C++
0 vote166 views1 answer
C++ over load oprator to print variable of clas
C++
2 votes117 views1 answer
Ascii to char c++
C++
0 vote186 views1 answer
How to make dictionary of numbers in c++
C++
1 vote162 views1 answer
Why are inline keyword in header c++
C++
0 vote168 views1 answer
Result += a +b in c++ meaning
C++
0 vote177 views1 answer
C++ find index of all occurrences in string
C++
0 vote172 views2 answers
C++ typeid
C++
0 vote155 views1 answer
Clear qlayout
C++
2 votes160 views1 answer
How to use string variable in switch case in c++
C++