TY  - BOOK
AU  - Kubica, Jeremy 
TI  - Data structures the fun way : : an amusing adventure with coffee-filled examples 
SN  - 9781718502604
AV  - QA 76.9.D35 .K83 2022 
PY  - 2022///
CY  - San Francisco
PB  - No starch press
KW  - COMPUTER SCIENCE
KW  - DATA STRUCTURES
N1  - Includes index; Introduction -- Chapter 1: Information in Memory -- Chapter 2: Binary Search -- Chapter 3: Dynamic Data Structures -- Chapter 4: Stacks and Queues -- Chapter 5: Binary Search Trees -- Chapter 6: Tries and Adapting Data Structures -- Chapter 7: Priority Queues and Heaps -- Chapter 8: Grids -- Chapter 9: Spatial Trees -- Chapter 10: Hash Tables -- Chapter 11: Caches -- Chapter 12: B-Trees -- Chapter 13: Bloom Filters -- Chapter 14: Skip Lists -- Chapter 15: Graphs -- Conclusion

N2  - This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures — a critical component in any programming endeavor. You’ll learn how to work with more than 15 key data structures, from stacks, queues, and caches to bloom filters, skip lists, and graphs. You’ll also master linked lists by virtually standing in line at a cafe, hash tables by cataloging the history of the summer Olympics, and Quadtrees by neatly organizing your kitchen cabinets, all while becoming familiar with basic computer science concepts, like recursion and running time analysis
ER  -