30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

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.

Asked at:

Meta

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late April, 2025

Meta

Senior

Late March, 2025

Meta

Mid-level

Mid March, 2025

Meta

Mid-level

Get Premium to View All 6 Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 958. Check Completeness of a Binary Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact