Checking whether a binary tree is balanced or not using recursion

Balanced: no path from root to leaf node is longer than another such path by 1.

The code is just so elegant...

this can be extended to general trees with more than two children by examining all children's maxDepth or minDepth.