Binary Tree Level Order Traversal
Medium
Trees
•
Grind 75NeetCode 150
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).

Constraints:

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