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 vote233 views1 answer
Iterating in map/unordered map c++
C++
7 votes178 views1 answer
Convert binary to decimal c++ stl
C++
0 vote187 views1 answer
Split 2d array into chunks in c++
C++
0 vote188 views1 answer
Assign value to a pointer
C++
2 votes190 views3 answers
C++ lambda
C++
1 vote209 views1 answer
Find the graph is minimal spanig tree or not
C++
0 vote206 views1 answer
Prime or not in cpp
C++
18 votes188 views5 answers
C++ clear console
C++
3 votes197 views2 answers
Opencv(4.1.2) /io/opencv/modules/imgproc/src/resize.cpp:3720: error: (-215:assertion failed) !ssize.empty() in function 'resize'
C++
5 votes177 views1 answer
Screen record ios simulator
C++