Category:Abstract data types
Here is a list of articles in the Abstract data types category of the Computing portal that unifies foundations of mathematics and computations using computers.
![]() |
Wikimedia Commons has media related to Abstract data types. |
Pages in category "Abstract data types"
The following 25 pages are in this category, out of 25 total.
- Abstract data type (computing)
A
- Associative array (computing)
- Augmented map (computing)
C
- Collection (abstract data type) (computing)
- Container (abstract data type) (computing)
D
- Double-ended priority queue (computing)
- Double-ended queue (computing)
G
- Graph (abstract data type) (computing)
I
- Iterator (computing)
K
- Kinetic priority queue (computing)
L
- Linked data structure (computing)
- List (abstract data type) (computing)
M
- Monoque (computing)
- Multimap (computing)
- Multiset (abstract data type) (computing)
O
- Obstack (computing)
- Ordinal tree (computing)
- Ordinal Tree (computing)
P
- Peek (data type operation) (computing)
- Pile (abstract data type) (computing)
- Priority queue (computing)
Q
- Queue (abstract data type) (computing)
S
- Set (abstract data type) (computing)
- Stack (abstract data type) (computing)
U
- U-form (computing)