• Home
  • Random
  • Nearby
  • Log in
  • Settings
Donate Now If Wikipedia is useful to you, please give today.
  • About Wikipedia
  • Disclaimers
Wikipedia

Category:Heaps (data structures)

  • Category
  • Talk
  • Language
  • Watch
  • Edit
Wikimedia Commons logo
Wikimedia Commons has media related to Heaps.

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 32 pages are in this category, out of 32 total. This list may not reflect recent changes.

 

  • Heap (data structure)

0–9

  • 2–3 heap

A

  • Adaptive heap sort
  • Addressable heap
  • AF-heap

B

  • B-heap
  • Beap
  • Binary heap
  • Binomial heap
  • Brodal queue

D

  • D-ary heap
  • Double-ended priority queue

F

  • Fibonacci heap

H

  • Heapsort

K

  • K-D heap
  • Kinetic hanger
  • Kinetic heap
  • Kinetic heater

L

  • Leftist tree

M

  • Mergeable heap
  • Min-max heap

P

  • Pairing heap

Q

  • Queap

R

  • Radix heap

S

  • Shadow heap
  • Skew binomial heap
  • Skew heap
  • Smoothsort
  • Soft heap
  • Strict Fibonacci heap

T

  • Treap

W

  • Weak heap
Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Heaps_(data_structures)&oldid=626636261"