Template:CS trees
From blackwiki
Revision as of 08:47, 18 January 2015 by
71.41.210.146
(
talk
)
(Why was
BSP tree
not listed? And a few heaps.)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
Collapse
v
t
e
Tree data structures
Search trees
(
dynamic sets
/
associative arrays
)
2–3 tree
2–3–4 tree
AA tree
(a,b)-tree
AVL tree
B-tree
B+ tree
B*-tree
B
x
-tree
Binary search tree
Optimal binary search tree
Dancing tree
HTree
Interval tree
Order statistic tree
Red–black tree
(
left-leaning
)
Scapegoat tree
Splay tree
T-tree
Treap
UB-tree
Heaps
Binary
Binomial
Fibonacci
Leftist
Pairing
Skew
Van Emde Boas
Tries
Hash tree
Radix tree
Suffix tree
Ternary search tree
X-fast trie
Y-fast trie
Spatial
data partitioning trees
BK-tree
BSP tree
Cartesian tree
Hilbert R-tree
k
-d tree
(
implicit
k
-d tree
)
M-tree
Metric tree
MVP tree
Octree
Priority R-tree
Quadtree
R-tree
R+ tree
R* tree
Segment tree
VP tree
X-tree
Other trees
Cover tree
Doubly chained tree
Exponential tree
Fenwick tree
Finger tree
Fusion tree
Hash calendar
iDistance
K-ary tree
Left-child right-sibling binary tree
Link/cut tree
Log-structured merge-tree
Merkle tree
PQ tree
Range tree
SPQR tree
Top tree
Category
:
Computer science templates
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