Leetcode 987. Vertical Order Traversal of a Binary Tree
Assign each node coordinates (row, col) with root at (0,0) and children at (r+1,c±1), then produce a list of columns from leftmost to rightmost where nodes in each column are ordered by increasing row and, for nodes with the same row and column, by increasing node value.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late August, 2025
Meta
Senior
Mid June, 2025
Meta
Senior
Early May, 2025
Meta
Senior
Print Binary tree vertical view
Your account is free and you can post anonymously if you choose.