Leetcode 958. Check Completeness of a Binary Tree

Determine whether a binary tree is complete — i.e., every level except possibly the last is fully filled and nodes in the last level are as far left as possible. This is typically checked with a level-order traversal (or heap-like indexing) to ensure no non-null node appears after a null position.