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

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 leftChild;
        public Node rightChild;
        public Node(int data)
        {
            this.data = data;
        }
    }

Height Of Binary Tree


height(10) = max(height(5), height(30)) + 1

height(30) = max(height(28), height(42)) + 1
height(42) = 0 (no children)
height(28) = 0 (no children)

height(5) =  max(height(4), height(8)) + 1
height(4) = 0 (no children)
height(8) = 0 (no children)

Source: nullorempty.org

Similar codes

0 vote191 views1 answer
Concatenating two int in java
Java
0 vote243 views1 answer
Instance of keyword
Java
2 votes186 views1 answer
Bukkit scoreboard
Java
9 votes182 views6 answers
Print java
Java
0 vote191 views1 answer
Java resultset.absolute
Java
2 votes187 views1 answer
Java random guid
Java
0 vote188 views1 answer
Java data table source tymeLeaf
Java
1 vote239 views1 answer
Iterate through collection java
Java
3 votes290 views1 answer
Duplicate class android.support.v4.app.
Java
1 vote189 views1 answer
Kotlin enable and disable parents view children
Java