← Questions
Binary tree zigzag level-order traversal
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return a binary tree's values level by level, alternating direction: left to right on the first level, right to left on the next, and so on. Use a BFS by levels and reverse (or fill from the end) on alternate levels.
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