GoalScope — level_order_traversal (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def level_order_traversal(root):↵
"""Level order traversal of a binary tree."""↵
if not root:↵
return []↵
result = []↵
queue = [root]↵
while queue:↵
level_size = len(queue)↵
current_level = []↵
for _ in range(level_size):↵
node = queue.pop(0)↵
current_level.append(node.val)↵
if node.left:↵
queue.append(node.left)↵
if node.right:↵
queue.append(node.right)↵
result.append(current_level)↵
return result↵
</code>