GoalScope — zigzag_level_order (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def zigzag_level_order(root):↵
"""Given a binary tree, return the zigzag level order traversal of its nodes' values."""↵
if not root:↵
return []↵
result, level, direction = [], [root], 1↵
while level:↵
next_level, vals = [], []↵
for node in level:↵
vals.append(node.val)↵
if node.left:↵
next_level.append(node.left)↵
if node.right:↵
next_level.append(node.right)↵
result.append(vals[::direction])↵
level = next_level↵
direction *= -1↵
return result↵
</code>