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

4 votes296 views2 answers
Input pdf latex
C++
18 votes241 views4 answers
How to string to integer in c++
C++
0 vote267 views1 answer
Public method
C++
19 votes274 views1 answer
How to output to a file in c++
C++
4 votes269 views3 answers
REFERENCE C++
C++
1 vote255 views1 answer
Certificate exe application
C++
72 votes301 views4 answers
C++ vector pop first element
C++
1 vote240 views1 answer
How to reset linerenderer unity
C++
0 vote261 views1 answer
C++ foreach
C++
4 votes260 views1 answer
Cpp iterator of element
C++