109. Binary Tree Level Order Traversal

You're building a tree visualization component that needs to display nodes level by level.

Given the root of a binary tree, return the level order traversal of its nodes' values (from left to right, level by level).

Requirements

• Return an array of arrays, one inner array per level
• Maintain left-to-right ordering within each level
• If the tree is empty, return []