Binary Tree Zigzag Side View

Given a binary tree, return the 'zigzag side view': one node value per level, alternating between the leftmost node on even levels and the rightmost node on odd levels (or vice versa). This is a variation of the Binary Tree Right Side View problem where instead of always selecting the rightmost node at each depth, you alternate between left and right.