Binary Tree Level Order Traversal

📝 Description

Return level order traversal of binary tree nodes

Input Format

Binary tree represented as list (level-order)

Output Format

[[], [], ...] for each level

Constraints

Number of nodes ≤ 10^5

🔍 Sample Input

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

✅ Sample Output

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