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 vote314 views1 answer
Jaggies
Java
0 vote338 views1 answer
Captilize the first letter of the string
Java
0 vote298 views1 answer
Application properties for using H2 in-memory-DB
Java
2 votes291 views6 answers
How to reverse a number in java
Java
0 vote520 views1 answer
Design a class ‘complex ‘with data members for real and imaginary part. provide default and parameterized constructors. write a program to perform arithmetic operations of two complex numbers.
Java
3 votes275 views1 answer
Regular expression java
Java
8 votes289 views3 answers
Len of number in java
Java
-1 vote308 views2 answers
JButton
Java
0 vote308 views1 answer
How to split string with dolor sign in java
Java
0 vote308 views1 answer
Volkswagen fox
Java