Vertical Order Traversal

DSA practice question · Hard · Trees

Return node values column by column, left to right. Helper classes (ListNode / TreeNode, build_list, to_list, build_tree) are preloaded for you.

Example 1

Input: print(vertical_order(build_tree([3, 9, 20, None, None, 15, 7])))
print(vertical_order(build_tree([1, 2, 3, 4, 6, 5, 7])))
Output: [[9], [3, 15], [20], [7]]
[[4], [2], [1, 5, 6], [3], [7]]

Your program must print exactly this output for these test calls.

Constraints

ties in the same row and column sorted by value

Solve it in the live editor on this page — run on sample data, then submit against hidden tests.

‹ Flatten Binary Tree to Linked List · Top K Frequent Elements ›

Vertical Order Traversal – DSA Interview Problem | TechTown
T
Tech Town
Hi, {{ authName }} · Dashboard Log Out Log In Sign Up Free
DSA Interview Practice

Practice DSA Online

{{ totalCount }} questions · {{ shHardPct }}% Hard. Data structures & algorithms interview problems in 13 patterns. Solve in Python, JavaScript or Java in your browser, run sample tests, then submit against hidden tests.

{{ totalCount }}
Questions
{{ shTopicCount }}
Topics
{{ solvedCount }}
Solved
{{ accuracy }}
Acceptance
Bookmark Question Topic Difficulty Status
{{ r.n }} - {{ r.title }}{{ r.badge }}{{ r.lock }} {{ r.topic }} {{ r.difficulty }} {{ r.statusIcon }}
No questions match these filters.
Showing {{ shRange }} of {{ shFilteredCount }}

Guests can solve {{ freeLimit }} problems for free. Log in or sign up (free) to unlock everything, keep your streak and appear on the leaderboard. New to a topic? Learn it first in the DSA course.

{{ p.num }}. {{ p.title }} {{ p.difficulty }} {{ p.topic }} {{ p.solvedLabel }}
{{ shPointsLabel }} ⏱ {{ shTimer }}
Embed this questionPaste on a blog, course page or LMS. Free to use — educator guide
{{ shEmbedCode }}

{{ p.statement }}

Example {{ ex.n }}
Input: {{ ex.input }}
Output: {{ ex.output }}
{{ ex.note }}
Constraints

{{ p.constraints }}

  1. {{ h }}
Learn the concept first: {{ p.topic }} in the DSA course
Your submissions (last 20, saved on this device)

No submissions yet. Press Submit to judge your code against all tests.

{{ sb.verdict }}
{{ sb.meta }}
🔒 Solution locked

The model solution and step-by-step explanation unlock when you solve this problem or after 3 unsuccessful submissions ({{ shFailsLabel }}). Struggling? Try the hints on the Question tab first.

Why this approach — step by step
  1. {{ st }}
Optimal solution ({{ solutionLangName }}){{ solutionLangNote }}
{{ solutionCode }}
Runs in an isolated browser sandbox · {{ engineLabel }}
Java runs in your browser via TechTown's Java-to-JavaScript engine — supports the standard library used in DSA problems (collections, StringBuilder, Math…).
{{ verdict }} {{ verdictDetail }}
{{ errorText }}
{{ tr.label }}
Input: {{ tr.input }}
Expected: {{ tr.expected }}
Your output: {{ tr.got }}
stdout:
{{ stdout }}

Enjoying your practice journey?

Create your free TechTown account to unlock every problem, track your progress, bookmark questions and keep preparing for interviews.

Log in / Sign up