Template:CS trees
From blackwiki
Revision as of 23:47, 11 January 2017 by
71.41.210.146
(
talk
)
(
Brodal queue
is another type of heap (albeit impractical))
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
v
t
e
Tree data structures
Search trees
(
dynamic sets
/
associative arrays
)
2–3
2–3–4
AA
(a,b)
AVL
B
B+
B*
B
x
(
Optimal
)
Binary search
Dancing
HTree
Interval
Order statistic
(
Left-leaning
)
Red-black
Scapegoat
Splay
T
Treap
UB
Weight-balanced
Heaps
Binary
Binomial
Brodal
Fibonacci
Leftist
Pairing
Skew
Van Emde Boas
Weak
Tries
Ctrie
C-trie (compressed ADT)
Hash
Radix
Suffix
Ternary search
X-fast
Y-fast
Spatial
data partitioning trees
Ball
BK
BSP
Cartesian
Hilbert R
k
-d
(
implicit
k
-d
)
M
Metric
MVP
Octree
Priority R
Quad
R
R+
R*
Segment
VP
X
Other trees
Cover
Exponential
Fenwick
Finger
Fractal tree index
Fusion
Hash calendar
iDistance
K-ary
Left-child right-sibling
Link/cut
Log-structured merge
Merkle
PQ
Range
SPQR
Top
Category
:
Computer science navigational boxes
Navigation menu
Personal tools
English
Create account
Log in
Namespaces
Template
Discussion
Variants
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information