Part II · Linear Data Structures and Core Collections
15. Data Structure Selection and Implementation Trade-offs
5 lessons•31 topics•Beginner / Intermediate
5 of 5 lessons published
15.011 animated
Operation matrices
- Index access
- Insert
- Delete
- Search
- Min/max
- Predecessor/successor
- Range query
15.021 animated
Memory models
- Array contiguous storage
- Node object overhead
- Hash bucket overhead
- Tree pointers
- Heap fragmentation
- GC pressure
15.032 animated
Practical choices
- ArrayList vs LinkedList
- HashMap vs TreeMap
- HashSet vs TreeSet
- ArrayDeque vs Stack
- Heap vs ordered map
15.04Lesson
Correctness contracts
- Stable order
- Uniqueness
- Key immutability
- Comparator consistency
- Thread safety boundaries
15.058 animated
Building structures from scratch
- Dynamic array
- Linked list
- Queue
- Stack
- Hash table
- BST
- Binary heap
- Trie