Leetcode 314. Binary Tree Vertical Order Traversal
Group tree nodes by their horizontal (column) index and return a list of columns from leftmost to rightmost, preserving top-to-bottom order and left-to-right ordering for nodes that share the same position—commonly solved by BFS/level-order traversal with column indices and a map.
Asked at:
Meta
Uber
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late September, 2025
Meta
Senior
Late September, 2025
Meta
Senior
Late September, 2025
Meta
Senior
Your account is free and you can post anonymously if you choose.