Live briefing
Everything about List of data structures
Data organization and storage formats
This is a list of well-known data structures. For a comparison of running times for a subset of this list see comparison of data structures. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: List of data structuresA 5-minute orientation
- Skim a recent paper: Local Differentially Private Fuzzy Counting in Stream Data Using Probabilistic Data StructuresInfluential work since 2022
- Pick up a classic book: Structure and Interpretation of Computer Programs (SICP)The most-reprinted book on the subject
- Read the landmark paper: Extrapolating linked list data structures to 3rd dimensionCited 7 times
- Go sideways: Data structureA closely related topic
- Go sideways: Heap (data structure)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Extrapolating linked list data structures to 3rd dimension
A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures
Teaching data structures using list boxes
Scheduling with list processing and problem oriented data structures
List-based Data Structures for Efficient Management of Advance Reservations
International Union of Crystallography, Commission on Crystallographic Data List of works containing new data on crystal structures, 1961.
Comparison of Skip List Algorithms to Alternative Data Structures
Assertion techniques for dynamic monitoring of linear list data structures
🆕 Influential since 2022
📚 Books worth reading
Structure and Interpretation of Computer Programs (SICP)Harold Abelson, Gerald Jay Sussman · 1985
C++ ProgrammingD. S. Malik · 2004
Code CompleteSteve McConnell · 1993
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Starting Out with JavaTony Gaddis · 2004
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Fundamentals of data structures in CEllis Horowitz · 1993
An introduction to data structures with applicationsJean-Paul Tremblay, Paul Gordon Sorenson · 1976
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Data structure In computer science, a data structure is a way to organize and store data that is usually chosen for efficient access to data. More precisely, a data structure…
- Heap (data structure) In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node…
- List of graph theory topics This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology. Amalgamation Bipartite graph Complete bipartite…
- Radix tree In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie…
- Trie In computer science, a trie (/ˈtraɪ/, /ˈtriː/ ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store…
- Ternary search tree In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary…
- Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…
- Deterministic acyclic finite state automaton In computer science, a deterministic acyclic finite state automaton (DAFSA), is a data structure that represents a set of strings, and allows for a query…