Height of binary tree java

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

Height of binary tree java

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;
        }
    }

Source: grepper.com

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;
        }
    }

Source: grepper.com

Height of Binary tree Java

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;
        }
    }

Source: grepper.com

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

Height of binary tree

//claculate the minimum height of binary tree 
const minHeightTree =(root)=>{
  if (!root) return 0;
  let left = minHeightTree(root.left);
  console.log(left)
  let right = minHeightTree(root.right);
  console.log(right)
 
  if(left< right){
 
   return left +1 ;
 
  }else { 
   return right+1 ; 
  }
 };

-1

Source: grepper.com

Similar codes

92 votes228 views6 answers
Split string into array java
Java
1 vote118 views2 answers
Does finally block executed after crash
Java
1 vote86 views1 answer
Java to kotlin converter
Java
0 vote129 views1 answer
Open google maps cycling navigation
Java
3 votes127 views1 answer
Advantages of using Java
Java
0 vote136 views2 answers
Unable to find bundled Java version mac m1
Java
0 vote142 views1 answer
How to get the content og a bottongroup in java
Java
0 vote133 views1 answer
Object of a class
Java
1 vote180 views1 answer
Event api spigot
Java
0 vote153 views1 answer
Read and existing dir content in java
Java