ntree.aiLevel Order Traversal
Level Order Traversal
mediumsolvedattempted
Given the root of a binary tree, return its values level by level, from the root down.
Every level is a separate array, read from left to right.
Example 1:
3
9
1
20
15
7
Input: root = [3, 9, 20, 1, null, 15, 7]
Output: [[3], [9, 20], [1, 15, 7]]
Example 2:
1
Input: root = [1]
Output: [[1]]
Example 3:
Input: root = []
Output: []
Constraints:
0 <= the number of nodes in the tree <= 2000-1000 <= Node.val <= 1000
# Definitions:# class TreeNode:# def __init__(self, val=0, left=None, right=None, parent=None):# self.val = val# self.left = left# self.right = right# self.parent = parent def levelOrder(root: TreeNode) -> list[list[int]]: pass Press Visualise to step through your code.