Given a binary tree. Determine if it is height-balanced. A height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differs by more than 1.
Definition of a tree:
Implement function isBalanced that returns true if the tree is balanced and false otherwise.
Function isBalanced returns true because tree is balanced.