← Questions
Binary tree vertical 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 column by column, from the leftmost column to the rightmost. The root is in column 0, a left child one column to the left of its parent and a right child one to the right. Within a column, list values from top to bottom, and left to right when two share a row.
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