Breaking News: Grepper is joining You.com. Read the official announcement!

Program to find if the Binary Tree has balanced height or not.

hritick bhushan answered on January 27, 2023 Popularity 7/10 Helpfulness 2/10

answer Program to find if the Binary Tree has balanced height or not.

Program to find if the Binary Tree has balanced height or not.

Comment

// Java code to implement the approach
 
import java.io.*;
import java.lang.*;
import java.util.*;
 
// Class to define the tree node
class Node {
    int key;
    Node left;
    Node right;
    Node(int k)
    {
        key = k;
        left = right = null;
    }
}
 
class GFG {
 
    // Driver code
    public static void main(String args[])
    {
        Node root = new Node(10);
        root.left = new Node(5);
        root.right = new Node(30);
        root.right.left = new Node(15);
        root.right.right = new Node(20);
 
        if (isBalanced(root) > 0)
            System.out.print("Balanced");
        else
            System.out.print("Not Balanced");
    }
 
    // Function to check if tree is height balanced
    public static int isBalanced(Node root)
    {
        if (root == null)
            return 0;
        int lh = isBalanced(root.left);
        if (lh == -1)
            return -1;
        int rh = isBalanced(root.right);
        if (rh == -1)
            return -1;
 
        if (Math.abs(lh - rh) > 1)
            return -1;
        else
            return Math.max(lh, rh) + 1;
    }
}

Popularity 7/10 Helpfulness 2/10 Language java

Source: www.geeksforgeeks.org

Tags: binary-tree find height java

Link to this answer
Share Copy Link