HashSet (a HashMap with dummy values), LinkedHashSet, TreeSet (Red-Black delegation), and EnumSet (the fastest Set you've never used). PriorityQueue's binary heap, ArrayDeque as the correct Stack and Queue, and the complete Deque contract.
// Lessons
- 01soon
The Set Contract — Uniqueness, equals() and hashCode()
- 02soon
HashSet — A HashMap in Disguise
- 03soon
LinkedHashSet — Insertion-Order Iteration from a HashSet
- 04soon
TreeSet — Sorted Iteration via Red-Black Tree Delegation
- 05soon
EnumSet — The Fastest Set You've Never Used
- 06soon
The Queue and Deque Contracts — FIFO, LIFO and Double-Ended
- 07soon
PriorityQueue — The Binary Heap Inside Java's Standard Library
- 08soon
ArrayDeque — The Right Stack and Queue Implementation (Not LinkedList)