Pages that link to "Template:Data structures"
Jump to navigation
Jump to search
The following pages link to Template:Data structures:
Displaying 37 items.
- Array (data structure) (transclusion) (← links)
- AVL tree (transclusion) (← links)
- Abstract data type (transclusion) (← links)
- Binary search tree (transclusion) (← links)
- B-tree (transclusion) (← links)
- Double-ended queue (transclusion) (← links)
- Hash table (transclusion) (← links)
- Heap (data structure) (transclusion) (← links)
- Linked list (transclusion) (← links)
- Priority queue (transclusion) (← links)
- Queue (abstract data type) (transclusion) (← links)
- Red–black tree (transclusion) (← links)
- Splay tree (transclusion) (← links)
- Trie (transclusion) (← links)
- Binary heap (transclusion) (← links)
- Associative array (transclusion) (← links)
- Set (abstract data type) (transclusion) (← links)
- List (abstract data type) (transclusion) (← links)
- Binomial heap (transclusion) (← links)
- Fibonacci heap (transclusion) (← links)
- Skip list (transclusion) (← links)
- Sparse matrix (transclusion) (← links)
- Self-balancing binary search tree (transclusion) (← links)
- Graph (abstract data type) (transclusion) (← links)
- Binary decision diagram (transclusion) (← links)
- 2–3 tree (transclusion) (← links)
- R-tree (transclusion) (← links)
- Unrolled linked list (transclusion) (← links)
- Disjoint-set data structure (transclusion) (← links)
- R*-tree (transclusion) (← links)
- Fractal tree index (transclusion) (← links)
- Optimal binary search tree (transclusion) (← links)
- Shadow heap (transclusion) (← links)
- K-D-B-tree (transclusion) (← links)
- Join-based tree algorithms (transclusion) (← links)
- Difference bound matrix (transclusion) (← links)
- Strict Fibonacci heap (transclusion) (← links)