Question

What would be the best way to approach determining if a binary search tree is balanced in scheme?

Answer 1

I forget the formula but the basic idea is that each level is fully populated. No excessive single nodes

Answer 2

A well-formed binary tree is said to be "height-balanced" if (1) it is empty, or (2) its left and right children are height-balanced and the height of the left tree is within 1 of the height of the right tree.

from: http://stackoverflow.com/questions/742844/how-to-determine-if-binary-tree-is-balanced