Jeremy Kubica is an engineer director specializing in artificial intelligence and machine learning. He received a Ph.D. in Robotics from Carnegie Mellon University and a BS in Computer Science from Cornell University. He spent his graduate school years creating algorithms to detect killer asteroids (actually stopping them was, of course, left as “future work”). He is the author of multiple books designed to introduce people to computer science, including Computational Fairy Tales and The CS Detective, as well as the Computational Fairy Tales Blog.

"The perfect book for novice programmers as well as developers who want to improve their knowledge of key software concepts."—Ben Dickson, TechTalks"Clear and fun to someone learning the topics for the first time. . . . overall a great read." —Jeanne Boyarsky, CodeRanch"A good book to read from beginning to end . . . a nice quick reference for reading about data structures, the complexity of each one, and for what is useful or not!"—Eduardo Blázquez, @Farenain, COSEC Lab at Charles III University of Madrid"Good overview of data structures, intuitive with good visualizations." —Lucille E Nguyen, Computational Social Scientist"A fun intro to the topic for self-taught programmers and data scientists."—Crow Intelligence

• IntroductionChapter 1: Information in MemoryChapter 2: Binary SearchChapter 3: Dynamic Data StructuresChapter 4: Stacks and QueuesChapter 5: Binary Search TreesChapter 6: Tries and Adapting Data StructuresChapter 7: Priority Queues and HeapsChapter 8: GridsChapter 9: Spatial TreesChapter 10: Hash TablesChapter 11: CachesChapter 12: B-TreesChapter 13: Bloom FiltersChapter 14: Skip ListsChapter 15: GraphsConclusion

Jeremy Kubica is an engineer director specializing in artificial intelligence and machine learning. He received a Ph.D. in Robotics from Carnegie Mellon University and a BS in Computer Science from Cornell University. He spent his graduate school years creating algorithms to detect killer asteroids (actually stopping them was, of course, left as “future work”). He is the author of multiple books designed to introduce people to computer science, including Computational Fairy Tales and The CS Detective, as well as the Computational Fairy Tales Blog.

"The perfect book for novice programmers as well as developers who want to improve their knowledge of key software concepts."—Ben Dickson, TechTalks"Clear and fun to someone learning the topics for the first time. . . . overall a great read." —Jeanne Boyarsky, CodeRanch"A good book to read from beginning to end . . . a nice quick reference for reading about data structures, the complexity of each one, and for what is useful or not!"—Eduardo Blázquez, @Farenain, COSEC Lab at Charles III University of Madrid"Good overview of data structures, intuitive with good visualizations." —Lucille E Nguyen, Computational Social Scientist"A fun intro to the topic for self-taught programmers and data scientists."—Crow Intelligence

• IntroductionChapter 1: Information in MemoryChapter 2: Binary SearchChapter 3: Dynamic Data StructuresChapter 4: Stacks and QueuesChapter 5: Binary Search TreesChapter 6: Tries and Adapting Data StructuresChapter 7: Priority Queues and HeapsChapter 8: GridsChapter 9: Spatial TreesChapter 10: Hash TablesChapter 11: CachesChapter 12: B-TreesChapter 13: Bloom FiltersChapter 14: Skip ListsChapter 15: GraphsConclusion

Jeremy Kubica is an engineer director specializing in artificial intelligence and machine learning. He received a Ph.D. in Robotics from Carnegie Mellon University and a BS in Computer Science from Cornell University. He spent his graduate school years creating algorithms to detect killer asteroids (actually stopping them was, of course, left as “future work”). He is the author of multiple books designed to introduce people to computer science, including Computational Fairy Tales and The CS Detective, as well as the Computational Fairy Tales Blog.

"The perfect book for novice programmers as well as developers who want to improve their knowledge of key software concepts."—Ben Dickson, TechTalks"Clear and fun to someone learning the topics for the first time. . . . overall a great read." —Jeanne Boyarsky, CodeRanch"A good book to read from beginning to end . . . a nice quick reference for reading about data structures, the complexity of each one, and for what is useful or not!"—Eduardo Blázquez, @Farenain, COSEC Lab at Charles III University of Madrid"Good overview of data structures, intuitive with good visualizations." —Lucille E Nguyen, Computational Social Scientist"A fun intro to the topic for self-taught programmers and data scientists."—Crow Intelligence

• IntroductionChapter 1: Information in MemoryChapter 2: Binary SearchChapter 3: Dynamic Data StructuresChapter 4: Stacks and QueuesChapter 5: Binary Search TreesChapter 6: Tries and Adapting Data StructuresChapter 7: Priority Queues and HeapsChapter 8: GridsChapter 9: Spatial TreesChapter 10: Hash TablesChapter 11: CachesChapter 12: B-TreesChapter 13: Bloom FiltersChapter 14: Skip ListsChapter 15: GraphsConclusion