I would appreciate if it was completed in Java.

Project 6: Height-Balanced Binary Trees Due: October 27, 1 PM In this project, you will determine whether a binary tree input by the user (in the form of discussed in the slides/class) is height-balanced or not. A binary tree is said to be height-balanced if each internal node (including the root) in the tree is height-balanced. A node is said to be height-balanced absolute difference in the heights of its left sub tree and right sub tree is at most 1. The binary tree (a) below is not height-balanced (as nodes 1 and 2 are not balanced), whereas the binary tree (b) below is height-balanced. if the Note that the height of a leaf node is 0 and the height of a non-existing tree (or sub tree) is -1. Height of Abs. Height Dif. YES Node Height of Left subtree Right subtree Diff. Balanced 2 2 2 YES No NO YES YES 4 (a) A Binary Tree that is "not" Height-Balanced