A data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data.
It often goes hand in hand with Algorithms.
With data structures, you can perform 4 primary types of actions:
- Accessing
- Searching
- Inserting
- Deleting
Common data structures include:
- Array
- Linked List
- List
- Stack
- Queue
- Deque
- Set
- Hash Table
- Tree
- Binary Tree
- Binary Search Tree
- Heap
- Priority Queue
- Graph
- Adjacency List
- Adjacency Matrix
- Trie
- Matrix
See also: Data structure - Wikipedia
See:
- GitHub - jamiebuilds/itsy-bitsy-data-structures: :europeancastle: All the th…
- Dictionary of Algorithms Data Structures
Anki
id: data-structure-definition deck: Computer Science::Data Structures tags: data-structures
Q: Why do programmers choose one data structure over another? A: Different data structures make different operations fast or slow, such as lookup, insertion, deletion, and traversal.
id: data-structure-common-operations deck: Computer Science::Data Structures tags: data-structures
Q: If a program often needs to find items quickly, what should you ask about a data structure? A: Ask how fast it can search or look up an item, and whether that speed changes as the collection grows.