Category:Data structures
 | Pages in this category should be moved to subcategories where applicable. This category may require frequent maintenance to avoid becoming too large. It should directly contain very few, if any, pages and should mainly contain subcategories. |
In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow a more efficient algorithm to be used. The choice of the data structure must begin from the choice of an abstract data structure.
Subcategories
This category has the following 19 subcategories, out of 19 total.
A
- Amortized data structures (18 P)
B
- Bit data structures (8 P)
C
- Compiler structures (4 P)
D
F
G
- Graph data structures (34 P)
H
- Hash-based data structures (16 P)
K
- Kinetic data structures (16 P)
L
- Linked lists (16 P)
P
S
- Succinct data structure (2 P)
T
Pages in category "Data structures"
The following 20 pages are in this category, out of 20 total. This list may not reflect recent changes.