Vertical Order Traversal | Dataford Interview Questions

Given a binary tree, return the vertical order traversal.

Represent each node as [value, left, right], where a missing child is null; the root is either such a node or null. Return a list of columns from the leftmost column to the rightmost column. Within each column, preserve top-to-bottom order and left-to-right order for nodes on the same level.

Function signature: def vertical_order(root):

Constraints

0 <= number of nodes <= 10^4
Each node is represented as [value, left, right]
value is an integer
A missing child is represented by null
The input forms a valid binary tree

Function Signature

def vertical_order(root):

Your question is Vertical Order Traversal. 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

Given a binary tree, return the vertical order traversal.

Function signature: def vertical_order(root):

Constraints

0 <= number of nodes <= 10^4
Each node is represented as [value, left, right]
value is an integer
A missing child is represented by null
The input forms a valid binary tree

Function Signature

def vertical_order(root):

Your question is Vertical Order Traversal. 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.