binary-tree-level-order-traversal

< Previous 　　　　　　　　　　　　　　　　 Next >

102. Binary Tree Level Order Traversal (Medium)

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]]

Example 2:

Input: root = [1]
Output: [[1]]

Example 3:

Input: root = []
Output: []

 

Constraints:

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

Related Topics

[Tree] [Breadth-First Search] [Binary Tree]

Similar Questions

1. Binary Tree Zigzag Level Order Traversal (Medium)
2. Binary Tree Level Order Traversal II (Medium)
3. Minimum Depth of Binary Tree (Easy)
4. Binary Tree Vertical Order Traversal (Medium)
5. Average of Levels in Binary Tree (Easy)
6. N-ary Tree Level Order Traversal (Medium)
7. Cousins in Binary Tree (Easy)