← Questions
Check completeness of a binary tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding