← Return

103. Binary Tree Zigzag Level Order Traversal^Medium

Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).

• Problem
• Solutions
  • Groovy
  • Java
  • JavaScript
  • Kotlin
  • Python
  • TypeScript