Jump to content

Category:Heaps (data structures)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Alexbot (talk | contribs) at 04:59, 7 March 2008 (robot Adding: zh:Category:堆). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

P

Pairing heap

Q

Queap

R

Radix heap

S

T

Treap

W

Weak heap

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

Trees (structure)