LESSON 312 OF 348 · BINARY TREES

Level Order Tree Traversal /homework in Rust

Practice O(n)

Given a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).

Example:

Input: [3, 9, 20, null, null, 15, 7]
    3
   / \
  9  20
    /  \
   15   7

Output: 
[
  [3],
  [9, 20],
  [15, 7]
]

STEP 1 OF 11

Guided

Ctrl + Enter to check

Keep going with RustAbout 340 step-by-step lessons, from your first line of code to coding interviews. Free to start.

Level Order Traversal in Rust