Vertical Order Traversal of a Binary Tree at DoorDash

Hard53.2% acceptance

This problem has 50.0% frequency at DoorDash.

Problem Description

Given the `root` of a binary tree, calculate the **vertical order traversal** of the binary tree. For each node at position `(row, col)`, its left and right children will be at positions `(row + 1, col - 1)` and `(row + 1, col + 1)` respectively. The root of the tree is at `(0, 0)`. The **vertical...

Read full problem and hints

Topics

Hash Table Tree Depth-First Search Breadth-First Search Sorting Binary Tree

Also asked at 10 companies

Amazon Bitgo Bloomberg Deliveroo Google Meta Microsoft Oracle Samsung TikTok

View Full Problem

Problem Description

Topics

Also asked at 10 companies

More DoorDash Questions