Given the root of a binary tree, determine whether it is a complete binary tree: every level except possibly the last is completely filled, and all nodes in the last level are as far left as possible.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.