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

102 votes291 views6 answers
Convert integer to string in c++
C++
2 votes191 views1 answer
Sfml draw tex
C++
3 votes202 views3 answers
Find all occurrences of a substring in a string c++
C++
0 vote186 views1 answer
Check .h files syntax c++
C++
0 vote232 views1 answer
C++ first index 0 or 1
C++
0 vote207 views1 answer
Assert warning c++
C++
0 vote214 views1 answer
How to calculate bitwise xor c++
C++
0 vote230 views1 answer
Pimpl c++
C++
0 vote248 views1 answer
How to input a file path in c++
C++
0 vote194 views1 answer
C++ message box error
C++