← Questions
Vertical order traversal of a binary tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Give every node of a binary tree a column (root at 0, left child one less, right child one more) and a row. Return the node values column by column from left to right, top to bottom within a column, and break ties between nodes in the same row and column by value.
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