Search trees

data structure in tree form with 0, 1, or 2 children per node, sorted for fast lookup

self-balancing binary search tree data structure

one kind of self-balancing binary search tree

self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again

In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain a dynamic set of ordered keys and allow binary searches among the keys. After any sequence of insertions and deletions of keys, the shape of the tree is a random variable with the same probability distribution as a random binary tree; in particular, with high probability its height is proportional to the logarithm of the number of keys, so that each search, insertion, or deletion operation takes logarithmic time to perform.

data structure in tree form sorted for fast lookup

operation that rebalances a binary tree without changing the inorder sequence of its nodes

tree data structure which implements an associative array with m-bit integer keys

type of self-balancing binary search tree

form of balanced tree used for storing and retrieving ordered data efficiently

binary tree variant that allows fast traversal

tree data structure

thumb|right|251px|An example T-tree

REDIRECT B-tree

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 multidimensional data. Like a B+ tree, information is stored only in the leaves. Records are stored according to Z-order, also called Morton order. Z-order is calculated by bitwise interlacing of the keys.

type of self-balancing binary search trees that can be used to implement dynamic sets, dictionaries (maps) and sequences

method for efficiently balancing binary search trees