Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Binary Tree Zigzag Side View
Reported Jan 10, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source