91. Binary Tree Level Order Traversal

MediumTree

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).

Examples

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

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

Explanation: Public test case for Binary Tree Level Order Traversal

Constraints

  • The number of nodes in the tree is in the range [0, 2000].
  • -1000 <= Node.val <= 1000
Loading...

Run checks all cases above. Submit evaluates all test cases.