← Morgan Stanley questions
CodingModerate

Breadth-First Traversal of a Tree

Filed under Morgan Stanley

Given the root of a binary tree, return the breadth-first traversal (level-order traversal) of its nodes' values as a list of lists.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Morgan Stanley questions

Collected from public candidate posts and coding forums. Updated Nov 2026.