Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Average of Levels in Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 958. Check Completeness of a Binary Tree
Reported Apr 30, 2025 · 4 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source