appendix C. Core data structures
You can’t build a house from the roof down. Likewise, you can’t build knowledge of advanced data structures if you don’t master the basics first.
In this appendix, we provide an overview of core data structures and present some of the most widely used algorithms.
It starts with a refresher of the most basic data structures: arrays, linked lists, trees, and hash tables. We do expect readers to already be familiar with them; after all, these structures are the building blocks of the most advanced ones. But we’ll provide a quick overview, just for your convenience.
In the last section, we briefly compare these data structures. For each of them, we will look at key features (like if they support ordering, and if ...
Get Advanced Algorithms and Data Structures now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
