← Questions
Check whether a binary tree is a max-heap
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Decide whether a binary tree is a valid max-heap: it must be complete (checked level by level) and every node must be at least as large as its children.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Write and test your solution herePython in your browser, the question's tests level by level, saved for you.Sign in to start coding