Category:Heaps (data structures)
Here is a list of articles in the category Heaps (data structures) of the Computing portal that unifies foundations of mathematics and computations using computers. A heap is a tree data structure with ordered nodes where the min (or max) value is the root of the tree and all children are less than (or greater than) their parent nodes.
Pages in category "Heaps (data structures)"
The following 28 pages are in this category, out of 28 total.
- Heap (data structure) (computing)
- 2–3 heap (computing)
- D-ary heap (computing)
- Fibonacci heap (computing)
- Heapsort (computing)
- Leftist tree (computing)
- Pairing heap (computing)
- Queap (computing)
- Treap (computing)
- Weak heap (computing)