Question: are binary search tree balanced?
Answer: Moreover, a binary tree is said to be balanced if the height of left and right children of every node differ by either -1, 0 or +1. This value is known as the balance factor.