In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and...

A B+ tree is an m-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves. The root...

science, a K-D-B-tree (k-dimensional B-tree) is a tree data structure for subdividing a k-dimensional search space. The aim of the K-D-B-tree is to provide...

Left-leaning red–black tree AVL tree B-tree (2–3 tree, 2–3–4 tree, B+ tree, B*-tree, UB-tree) Scapegoat tree Splay tree T-tree WAVL tree GNU libavl Cormen...

Btrfs (pronounced as "better F S", "butter F S", "b-tree F S", or "B.T.R.F.S.") is a computer storage format that combines a file system based on the copy-on-write...

coarse approximation of the data set. Similar to the B-tree, the R-tree is also a balanced search tree (so all leaf nodes are at the same depth), organizes...

Weight-balanced tree Zip tree B-tree B+ tree B*-tree Dancing tree 2–3 tree 2–3–4 tree Queap Fusion tree Bx-tree Heap Min-max heap Binary heap B-heap Weak heap...

elements. A 2–3 tree is a B-tree of order 3. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements. 2–3 trees were invented...

are asymptotically faster than a B-tree. Like a B-tree, a fractal tree index is a generalization of a binary search tree in that a node can have more than...

a search tree is a tree data structure used for locating specific keys from within a set. In order for a tree to function as a search tree, the key for...

Bx tree is a query that is used to update efficient B+ tree-based index structures for moving objects. The base structure of the Bx-tree is a B+ tree in...

mean ≈0.910. WAVL tree Weight-balanced tree Splay tree Scapegoat tree B-tree T-tree List of data structures Eric Alexander. "AVL Trees". Archived from the...

The UB-tree, also known as the Universal B-Tree, as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving...

search trees, including T-tree, treap, red-black tree, B-tree, 2–3 tree, and Splay tree. Binary search trees are used in sorting algorithms such as tree sort...

complete binary tree this way versus each node having pointer(s) to its sibling(s). 2–3 tree 2–3–4 tree AA tree Ahnentafel AVL tree B-tree Binary space partitioning...

terabytes. Tree (graph theory) Tree (set theory) Tree structure Exponential tree B-tree (2–3 tree, 2–3–4 tree, B+ tree, B*-tree, UB-tree) Dancing tree Fusion...

botany, a tree is a perennial plant with an elongated stem, or trunk, usually supporting branches and leaves. In some usages, the definition of a tree may be...

In computer science, the log-structured merge-tree (also known as LSM tree, or LSMT) is a data structure with performance characteristics that make it...

k-d trees exist. They include divided k-d tree, pseudo k-d tree, K-D-B-tree, hB-tree and Bkd-tree. Many of these variants are adaptive k-d trees. The...

2–3–4 trees are B-trees of order 4; like B-trees in general, they can search, insert and delete in O(log n) time. One property of a 2–3–4 tree is that...

science) Trees can also be represented radially: Kinds of trees B-tree Dancing tree Decision tree Left-child right-sibling binary tree Porphyrian tree Tree (data...

In computer science, an order statistic tree is a variant of the binary search tree (or more generally, a B-tree) that supports two additional operations...

In computer science, a dancing tree is a tree data structure similar to B+ trees. It was invented by Hans Reiser, for use by the Reiser4 file system....

processing R*-trees are a variant of R-trees used for indexing spatial information. R*-trees have slightly higher construction cost than standard R-trees, as the...

⁠a/b⁠ has as its two children the numbers ⁠1/1+1/q⁠ = ⁠a/a + b⁠ and q + 1 = ⁠a + b/b⁠. Every positive rational number appears exactly once in the tree....

B+ tree to accelerate lookups in directories. JFS can store 8 entries of a directory in the directory's inode before moving the entries to a B+ tree....

m-ary tree (for nonnegative integers m) (also known as n-ary, k-ary, k-way or generic tree) is an arborescence (or, for some authors, an ordered tree) in...

In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers on a finite universe, where...

technical features of LMDB are: Its use of B+ tree. With an LMDB instance being in shared memory and the B+ tree block size being set to the OS page size...

search extends binary search to unbounded lists. The binary search tree and B-tree data structures are based on binary search. Binary search works on...