Gamified challenge · Breadth-first search
The lanterns hang as a binary tree given as tree (a TreeNode root; examples are in level order with null for a missing lantern). Each lantern shows a number. The top lantern is floor 1, its children floor 2, and so on.
Write levels(tree) that returns one list per floor, top floor first, each listing that floor's numbers from left to right. An empty tower returns an empty list.
For [3, 9, 20, null, null, 15, 7] the answer is [[3], [9, 20], [15, 7]].
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google