Chapter 1 Introducing data structures Why you should learn about data structures (54.83 MB)
Chapter 10 Priority queues and heaps Handling data according to its priority (82.7 MB)
Chapter 11 Binary search trees A balanced container (77.34 MB)
Chapter 12 Dictionaries and hash tables How to build and use associative arrays (85.8 MB)
Chapter 13 Graphs Learning how to model complex relationships in data (72.42 MB)
Chapter 2 Static arrays Building your first data structure (76.46 MB)
Chapter 3 Sorted arrays Searching faster, at a price (41.67 MB)
Chapter 4 Big-O notation A framework for measuring algorithm efficiency (86.67 MB)
Chapter 5 Dynamic arrays Handling dynamically sized datasets (69.64 MB)
Chapter 6 Linked lists A flexible dynamic collection (95.58 MB)
Chapter 7 Abstract data types Designing the simplest container the bag (69.59 MB)
Chapter 8 Stacks Piling up data before processing it (64.42 MB)
Chapter 9 Queues Keeping information in the same order as it arrives (80.66 MB)