CodingMedium
Zig-Zag tree traversal and count ways to reach nth stair
Filed under Sigmoid
The question
Perform a zig-zag level order traversal of a binary tree, and count the number of ways to reach the nth stair by climbing 1 or 2 stairs at a time using both recursive and iterative approaches.
No write-up yet. Related questions below have one.
Related Sigmoid questions
Collected from public candidate posts and coding forums. Updated Nov 2026.