Given a binary tree, determine if it is height-balanced. A binary tree is considered height-balanced if the absolute difference in heights of the left and right subtrees is at most 1 for every node in the tree.Examples:Input:Output: TrueExplanation: The height difference between the left and right subtrees at all nodes is at
![How to Print all leaf Nodes of a Binary tree in Java [ Coding Interview Questions]](https://i.pinimg.com/originals/f4/14/a1/f414a163d5e7b79533cfca73d547a904.png)
