Height of the 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);  
    }  
}

Height of Binary tree

public static int height(Node root) 
{
  if(root==null)
  	return -1;
  if(root.left==null && root.right ==null)
  	return 0;
  return  1 + Math.max(height(root.left),height(root.right));
}


// node Structure for reference
    public class Node
    {
        public int data;
        public Node left;
        public Node right;
        public Node(int data)
        {
            this.data = data;
        }
    }

Height of the tree

int height(Node* root) {
        // Base Condition : if root is already null. then height must be -1 to make balance with recursion call...
        if(!root) return 0;
        
        // Actual Return statement.. for recursion call..
        return 1 + max(height(root->left), height(root->right));
    }

Similar codes

1 vote249 views1 answer
Crtdbg c++
C++
3 votes238 views1 answer
Function in struct c++
C++
0 vote240 views1 answer
Equals operator c++ overlaod
C++
5 votes237 views1 answer
Exit() in c++
C++
2 votes231 views1 answer
Cin.tie c++
C++
0 vote244 views1 answer
Pointers mcq sanfoundry
C++
0 vote267 views1 answer
Split text c++
C++
0 vote267 views1 answer
Balanced brackets hackerrank solution c++
C++
0 vote257 views1 answer
Get value of enum cpp
C++
0 vote265 views1 answer
Flag controlled while loop c++
C++