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

4 votes425 views3 answers
Find max key value in map in kotlin
Java
0 vote351 views1 answer
Arc() method from the processing library
Java
1 vote356 views3 answers
Scroll
Java
0 vote336 views1 answer
Java lamda
Java
1 vote342 views1 answer
Android application manifest
Java
0 vote352 views1 answer
Convert object array to int array java
Java
0 vote383 views1 answer
Immutable map java
Java
5 votes323 views2 answers
How to replace an element in array in java
Java
0 vote407 views1 answer
GetMapping("/rest/v1/books") in spring rest api
Java Spring
0 vote324 views1 answer
Java string split underscore
Java