Vertical Order Traversal in Trees | Dataford Interview Questions

Vertical Order Traversal of Binary Tree (LC Medium)

Asked in the Technical phone screen 1 stage.

Given the root of a binary tree, return its vertical order traversal. Nodes are grouped by column from left to right, and within each column they are ordered from top to bottom. If multiple nodes share the same row and column, order them by value.

Implement verticalTraversal(root) where root is the root node of a binary tree and the return value is a list of lists of integers.

Constraints

1 <= number of nodes <= 10^4
-10^9 <= Node.val <= 10^9
Node values may repeat

Function Signature

def verticalTraversal(root):

Your question is Vertical Order Traversal in Trees. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem