Project L
Ctrlk
  • Preface
  • Part 1
    • Introduction
    • Before We Begin
    • Basic Data Structures
      • Array and String
      • Hashing
      • Linked List
      • Stack
      • Queue
      • Binary Tree
        • Tree Traversal
          • Binary Tree Paths
          • Binary Tree Path Sum
          • Iterative
            • Flatten List Iterator
            • Flatten Nested List Iterator
            • Flatten 2D Vector
            • Binary Tree to Linked List
            • Zigzag Iterator
        • Divide and Conquer
        • Binary Search Tree
        • BFS
      • Priority Queue
  • Part 2
    • Divide and Conquer
    • Graph Search
    • Greedy Algorithm
    • Dynamic Programming
  • Part 3
    • Advanced Topics
  • Part 4
    • Advanced Data Structures
  • Part 5
    • System Design
    • References
Powered by GitBook
On this page
  1. Part 1
  2. Basic Data Structures
  3. Binary Tree
  4. Tree Traversal
  5. Iterative

Zigzag Iterator

Question (LC.281)

PreviousBinary Tree to Linked ListNextDivide and Conquer

Last updated 5 years ago