Given a binary tree, find its height, the minimum level containing a leaf node, and determine if the tree is 'perfectly balanced' in terms of leaf depth (i.e., height equals minimum leaf level).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.