Problem solving with programming: Checking if a binary tree is balanced

Problem solving with programming: Checking if a binary tree is balanced

Given a binary tree, how do we check if it is balanced or not?
We say that a binary tree is balanced if height difference of left  and the right sub-trees is at most 1 at  any node.

Read full article from Problem solving with programming: Checking if a binary tree is balanced