Uber logoUber
CodingMembers

Vertical Order Traversal of a Binary Tree

Members only

Given the root of a binary tree, sort its nodes by column from left to right. Nodes in the same column are ordered top to bottom by row, with ties on the same row and column broken by node value.

SWE
tree
tree-traversal
bfs
sorting
hard
Frequency
Single report
Last asked
2026-03-21
Stage
phone-screen

Log in to continue reading the full content

Comments

Sign in to join the discussion
Loading...