Complete Binary Tree Check
You are given the root of a binary tree. A tree is complete if every level except possibly the last is completely filled, and the last level's nodes are packed as far left as possible (no gap before any node). Return True if the tree is complete, otherwise False. An empty tree is complete.
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [1,2,3,4,5,6]
returns true
Last level is filled from the left.
Example 2
root [1,2,3,4,5,null,7]
returns false
There is a gap before 7.
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.