Choosing data structures — arrays, lists, stacks, hashes, and trees
This chapter compares arrays, linked lists, stacks, queues, hash maps, trees, and tries by operation complexity. It covers that stacks are LIFO and queues are FIFO, why hash maps average O(1) and what the worst case is, and why tries excel at prefix matching.