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 vote320 views1 answer
Error: ‘CV_WINDOW_AUTOSIZE’ was not declared in this scope
C++
0 vote345 views1 answer
C++ rainbow text
C++
5 votes302 views6 answers
While loop c++
C++
0 vote365 views3 answers
Script hack blox fruti
C++
3 votes312 views3 answers
C++ get char of string
C++
0 vote313 views1 answer
C++ pause linux
C++
25 votes292 views5 answers
Getline in c++
C++
0 vote321 views1 answer
Call of overloaded ‘swap(int&, int&)’ is ambiguous
C++
0 vote338 views1 answer
Ue4 get size of viewport c++
C++
0 vote307 views3 answers
An array that take different data type c++
C++