Binary Tree Zigzag Level Order Traversal

linkedin

Given the root of a binary tree, return its node values level by level in zigzag order: left to right for the first level, right to left for the second, and so on.

Input format: One comma-separat...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: