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 vote250 views1 answer
Sfml keyboard events cpp
C++
-1 vote208 views1 answer
Execute executable in c++
C++
0 vote304 views1 answer
Foo foo little dogs
C++
2 votes282 views2 answers
Array and for loop in c++
C++
1 vote306 views1 answer
C++ std::copy to cout
C++
1 vote308 views1 answer
Multithreading
C++
0 vote262 views1 answer
Format string cpp
C++
1 vote339 views1 answer
Default access modifier in c++ in struct
C++
7 votes281 views3 answers
Read string with spaces in c++
C++
0 vote253 views1 answer
Glew32.dll was not found
C++