Christopher SuAbout Blog Projects Contact More

Problem

Write an algorithm to verify that a binary tree is balanced. That is, the height of a node’s two subtrees never differ by more than one.