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

2 votes107 views2 answers
C++ get cursor position console
C++
1 vote132 views2 answers
How to print numbers with only 2 digits after decimal point in c++
C++
2 votes116 views1 answer
How to speed up cin and cout
C++
14 votes103 views1 answer
Dynamically generating 2d array in cpp
C++
0 vote123 views1 answer
Simple C++ game code
C++
4 votes115 views2 answers
Check uppercase c++
C++
12 votes106 views6 answers
Loop through map c++
C++
1 vote116 views2 answers
Auto i cpp
C++
45 votes104 views6 answers
Input in c++
C++
7 votes117 views3 answers
C++ get data type
C++