Category:Heaps (data structures)

This category is being considered for renaming to Category:Heaps (data structures).

This does not mean that any of the pages in the category will be deleted. They may, however, be recategorized.
Please share your thoughts on the matter at this category's entry on the Categories for discussion page. Please do not empty the category or remove this notice while the discussion is in progress.
add entry: {{subst:cfr2|Heaps (data structures)|Heaps (data structures)|text=Your reason(s) for the proposed rename. ~~~~}}

Administrators: Click here to rename

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

B

D

F

Fibonacci heap

H

Heapsort

K

L

Leftist tree

M

S

T

Treap

W

Weak heap

Pages in category "Heaps (data structures)"

0–9

A

B

D

F

H

K

L

M

P

Q

R

S

T

W