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

30:00

Binary Tree Level Order Traversal
medium
Topics
Companies

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

Example 1:
Input: {"root":[3,9,20,null,null,15,7]}
Output: [[3],[9,20],[15,7]]
Constraints:

  • The number of nodes is in the range [0,2000][0, 2000].

  • −1000≤Node.val≤1000-1000 \leq \text{Node.val} \leq 1000

Input
arr ={"root":[3,9,20,null,null,15,7]}

Init queue with root

3

9

20

15

7

Variables
No variables to display
DepthFunction Call
Stack empty
0/29