Jump to content

User:Matěj Grabovský/Books/Jungle

From Wikipedia, the free encyclopedia


Data structures

[edit]

Trees

[edit]
Tree (data structure)
Binary trees
Binary tree
Van Emde Boas tree
Cartesian tree
Top Tree
T-tree
Self-balancing binary search trees
Self-balancing binary search tree
Red-black tree
AVL tree
AA tree
Splay tree
Scapegoat tree
Treap
B-trees
B-tree
B+ tree
B*-tree
UB-tree
2-3 tree
2-3-4 tree
(a,b)-tree
Dancing tree
Htree
Bx-tree
Tries
Trie
Suffix tree
Radix tree
Ternary search tree
Binary space partitioning (BSP) trees
Binary space partitioning
Quadtree
Octree
Kd-tree
Implicit kd-tree
VP-tree
Non-binary trees
Exponential tree
Fusion tree
Interval tree
PQ tree
Range tree
SPQR tree
Spatial data partitioning trees
R-tree
R+ tree
R* tree
X-tree
M-tree
Segment tree
Fenwick tree
Hilbert R-tree
Other trees
Heap (data structure)
Hash tree
Finger tree
Metric tree
Cover tree
BK-tree
Doubly-chained tree
iDistance
Tree traversal
Tree traversal
Alpha-beta pruning
A* search algorithm
B*
Backtracking
Beam search
Bellman–Ford algorithm
Best-first search
Bidirectional search
Borůvka's algorithm
Branch and bound
Breadth-first search
D*
Depth-first search
Depth-limited search
Dijkstra's algorithm
Edmonds' algorithm
Floyd–Warshall algorithm
Fringe search
Hill climbing
IDA*
Iterative deepening depth-first search
Johnson's algorithm
Jump point search
Kruskal's algorithm
Lexicographic breadth-first search
Jarník algorithm
SMA*
Uniform-cost search