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

-1 vote161 views1 answer
C++ string to vector int
C++
0 vote171 views7 answers
Online converter c++ to c
C++
97 votes426 views6 answers
Change int to string c++
C++
0 vote165 views1 answer
Programs using vectors in c++
C++
0 vote160 views1 answer
MPI_PUT
C++
2 votes188 views1 answer
Cout was not declared in this scope
C++
0 vote160 views1 answer
C++ pass ofstream as argument
C++
0 vote159 views1 answer
Log base 10 c+_+
C++
37 votes211 views2 answers
Remove element by index from vector c++
C++
1 vote165 views2 answers
Cpp compare strings
C++