Check completeness of a binary tree

Given the root of a binary tree, return whether it is complete: every level is full except possibly the last, and the nodes on the last level sit as far left as possible. Explain why a level-order walk that stops at the first missing child is enough, and give the time and space.