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...

In computer science, an (a,b) tree is a kind of balanced search tree. An (a,b)-tree has all of its leaves at the same depth, and all internal nodes except...

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 Cormen, Thomas H.;...

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...

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...

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...

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...

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...

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...