Vertical order traversal of a binary tree
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 answer yet. Write the first one; the best answer gets endorsed.