Binary Tree Spiral Level Order
Amazon● MediumINTERNFULLTIMEPHONE SCREENONSITE INTERVIEWProblem statement
Return the values of a binary tree one level at a time in alternating directions.
The problem statement continues
ProExamples
Example 1
root = [3,9,20,null,null,15,7]return = [[3],[20,9],[15,7]]The root is left-to-right, the second level is right-to-left, and the third returns to left-to-right.
2 original screenshots from the interview report
ProFastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week