Java binary tree height method

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

Similar codes

0 vote219 views1 answer
Charat(0).touppercase() java
Java
14 votes229 views6 answers
Fibonacci
Java
5 votes197 views1 answer
Is a relationship concept java
Java
2 votes220 views2 answers
How can I split string according to space in java?
Java
0 vote216 views1 answer
Doc string in java
Java
10 votes225 views2 answers
Retrofit gradle
Java
1 vote217 views1 answer
File to multipartfile in java
Java
1 vote234 views1 answer
Circle line intersection java
Java
0 vote226 views1 answer
Java list swap 2 elements
Java
0 vote219 views1 answer
Elasticsearch java client dependency
Java