Binary Tree Level Order Traversal

Given the root of a binary tree, return the level order traversal of its nodes' values. This means visiting nodes 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
View editorial solution
Saving… · 10 lines
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right

class Solution:
def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
Console

Click Run to execute sample tests.