tree
abstract data type
range tree
data structure
Van Emde Boas tree
tree data structure which implements an associative array with m-bit integer keys
disjoint-set data structure
data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets
M-tree
Tree data structure
Enfilade
class of tree data structures used in Project Xanadu "Green" designs of the 1970s and 1980s
interval tree
tree data structure
interval tree
tree data structure
multi-way tree
tree data structure with a variable and unbounded number of branches per node
virtual file system
abstraction layer on top of one or more concrete file system, allowing applications to access files via a uniform logical representation
Fenwick tree
data structure that can efficiently update elements and calculate prefix sums in a table of numbers
dancing tree
tree data structure similar to B+ trees
balanced tree
a tree data structure where no leaf is much farther away from the root than any other leaf
hash tree
tree data structure whose nodes are recursively cryptographically hashed
heap
tree-based data structure in computer science
binomial tree
ordered tree data structure of order k ≥ 0, that is Bk, whose root has k children where the ith child is binomial tree of order k-i
X-tree
Index tree structure in computer science
link/cut tree
data structure for representing a forest, a set of rooted trees
FM-index
compressed full-text substring index based on the Burrows-Wheeler transform, with some similarities to the suffix array
R*-tree
a variant of R-trees used for indexing spatial information
abstract syntax tree
tree representation of the abstract syntactic structure of source code
B+ tree
B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves
segment tree
tree data structure used in computer science
exponential tree
tree data structure similar to the binary search tree where the dimension of the tree is not the same at all levels
binary tree
tree data structure in which each node has at most two children
R-tree
tree-based data structure, used to index spatial information
adaptive k-d tree
tree for multidimensional points where successive levels may be split along different dimensions