trade-offs between the structures, and strategies for picking the most appropriate ones.hash tables for the efficient retrieval of strings and other objects and finally.graph structures for representing more general relationships between data elements.min and max heaps for representing ordering based on priorities.binary and general tree structures for searching or representing hierarchical relationships.stacks and queues for computing with last-in/first-out and first-in/first-out orderings.iterators as an abstract model of enumerating the items in a sequence. ![]() ![]() list structures built from either nodes or arrays.asymptotic notation for mathematically discussing performance characteristics.This book is about the creation and analysis of efficient data structures. ![]() ![]() ( edit) ( help)Ī printable version of Data Structures is available. This book has a collection for ordering a
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |