In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number...

information. It was the first self-balancing binary search tree to be invented. A binary search tree is a rooted binary tree in which nodes are arranged...

splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary search...

self-balancing binary search trees of O(1), and their worst-case performance is highly unlikely when a good hash function is used. A self-balancing binary...

science) Self-balancing binary search tree Splay tree Strahler number Tree of primitive Pythagorean triples#Alternative methods of generating the tree Unrooted...

B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is...

efficiently balancing binary search trees – that is, decreasing their height to O(log n) nodes, where n is the total number of nodes. Unlike a self-balancing binary...

In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets, dictionaries...

worst-case behaviour can be improved by using a self-balancing binary search tree. Using such a tree, the algorithm has an O(n log n) worst-case performance...

computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. In an AVL tree, the heights of the...

red–black (LLRB) tree is a type of self-balancing binary search tree, introduced by Robert Sedgewick. It is a variant of the red–black tree and guarantees...

space and performs searches in O(logw n) time, which is asymptotically faster than a traditional self-balancing binary search tree, and also better than...

In computer science, a scapegoat tree is a self-balancing binary search tree, invented by Arne Andersson in 1989 and again by Igal Galperin and Ronald...

binary tree Order statistic tree Pagoda Randomized binary search tree Red–black tree Rope Scapegoat tree Self-balancing binary search tree Splay tree...

Red-black striped snake, a colubrid snake Red–black tree, a type of self-balancing binary search tree used in computer science Black and Red (disambiguation)...

other tree data structures, the optimization can be more extensive. In some sense, this can be considered to be a self-balancing binary search tree that...

leaf node. Rebalance the tree if needed. A T-tree is implemented on top of an underlying self-balancing binary search tree. Specifically, Lehman and...

tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information. The nodes in a red-black tree...

the graph in the form of adjacency lists and using a self-balancing binary search tree, binary heap, pairing heap, Fibonacci heap or a priority heap...

simple ordered tree, for example a binary search tree or self-balancing binary search tree, ordered by the 'low' values of the intervals. An extra annotation...

has the unit type or a sentinel value (like 1) – namely, a self-balancing binary search tree for sorted sets[definition needed] (which has O(log n) for...

Alternatively, when a self-balancing binary search tree is used, insertion and removal also take O(log n) time, although building trees from existing sequences...

depth-first search (DFS), the search tree is deepened as much as possible before going to the next sibling. To traverse binary trees with depth-first search, perform...

better time complexity bounds on search, delete, and insert operations in comparison to self-balancing binary search trees.: 1  Hash tables are also commonly...

a WAVL tree or weak AVL tree is a self-balancing binary search tree. WAVL trees are named after AVL trees, another type of balanced search tree, and are...

binary search tree (Optimal BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search...

dynamically optimal. Binary search algorithm Tango trees Splay trees Self-balancing binary search tree Optimal binary search tree Interleave lower bound...

Abstract syntax tree B-tree Binary tree Binary search tree Self-balancing binary search tree AVL tree Red–black tree Splay tree T-tree Binary space partitioning...

structure. This complexity for lookups is the same as for self-balancing binary search trees. In some data structures, an array of structures is used....

interval. Priority-sorted list; see linear search Key-sorted array; see binary search Self-balancing binary search tree Hash table Heap In this table, the asymptotic...