线性队列

链表

VisuAlgo
- Linked List
  - Linked List
  - Doubly Linked List
Princeton
- Text: Sect-1.3 Bags, Queues, and Stacks
- Video: Part-1/Week-2 Stacks
MIT
- Text: Sect-10.2 Linked lists

先进先出队列

VisuAlgo
- Linked List
  - Queue
  - Deque
Princeton
- Text: Sect-1.3 Bags, Queues, and Stacks
- Video: Part-1/Week-2 Queues
- Programming Assignment: Part-1/Week-2 Deques and Randomized Queues
MIT
- Text: Sect-10.1 Stacks and queues

后进先出队列（栈）

VisuAlgo
- Linked List
  - Stack
Princeton
- Text: Sect-1.3 Bags, Queues, and Stacks
- Video: Part-1/Week-2 Stacks
MIT
- Text: Sect-10.1 Stacks and queues

双向队列

随机队列

优先队列

二叉堆

VisuAlgo
- Binary Heap
Princeton
- Section: Sect-2.4 Priority Queues
- Video: Part-1/Week-4 Priority Queues
- Programming Assignment: Part-1/Week-4 8-Puzzle
MIT
- Text: Chap-6 Heapsort

Fibonacci 堆

MIT
- Text: Chap-19 Fibonacci Heaps

van Emde Boas 树

MIT
- Text: Chap-20 van Emde Boas Trees

应用

粒子碰撞

Princeton
- Text: Sect-6.1 Event Driven Simulation
- Video: Part-1/Week-4 Event-Driven Simulation
- Code: CollisionSystem.java

华容道

跳跃游戏

允许从 i 跳到 [i + 1, min(n - 1, i + k)] 中的任意位置，求：从 0 跳到 n - 1 的过程中，所触 a[k] 之和（得分）的最大值。