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

3 votes321 views2 answers
How to get the max value of an array java
Java
159 votes516 views6 answers
SCANNER CLASS IN JAVA
Java
1 vote314 views1 answer
Gradle reflections
Java
2 votes317 views1 answer
Android start service on boot
Java
10 votes328 views3 answers
Java check if int
Java
1 vote311 views3 answers
Android studio json parser
Java
0 vote298 views1 answer
Convert list of dto to map java
Java
0 vote321 views1 answer
Java check if a line is enclosed in quotation marks
Java
0 vote308 views1 answer
Clear a list in java
Java
3 votes321 views1 answer
How to compare 3 numbers in java
Java