In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of...

In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position...

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

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

In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child...

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

computing, a threaded binary tree is a binary tree variant that facilitates traversal in a particular order. An entire binary search tree can be easily traversed...

application stores the entire key–value pair at that particular location. A Binary Search Tree is a node-based data structure where each node contains a key and...

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

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

for these trees. Random binary trees have been used for analyzing the average-case complexity of data structures based on binary search trees. For this...

approach to the dynamic optimality problem on online algorithms for binary search trees involves reformulating the problem geometrically, in terms of augmenting...

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

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

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

ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with...

A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements...

the intervals do not overlap and they can be inserted into a simple binary search tree and queried in O ( log ⁡ n ) {\displaystyle O(\log n)} time. However...

in particular, filesystems. This is primarily because unlike binary search trees, B+ trees have very high fanout (number of pointers to child nodes in...

between nodes, which represent each character in the key. Unlike a binary search tree, nodes in the trie do not store their associated key. Instead, a node's...

hash tables and search trees. It is sometimes also possible to solve the problem using directly addressed arrays, binary search trees, or other more specialized...

level-order sequence of the corresponding balanced binary search tree. This places the first pivot of a binary search as the first element in the array. The second...

mathematics, tree rotation is an operation on a binary tree that changes the structure without interfering with the order of the elements. A tree rotation...

representation of objects within the space in the form of a tree data structure known as a BSP tree. Binary space partitioning was developed in the context of...

used in the definition of the treap and randomized binary search tree data structures for binary search problems, in comparison sort algorithms that perform...

Search trees store data in a way that makes an efficient search algorithm possible via tree traversal A binary search tree is a type of binary tree Representing...

neighbor searches) & Creating point clouds. k-d trees are a special case of binary space partitioning trees. The k-d tree is a binary tree in which every...

A tango tree is a type of binary search tree proposed by Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătrașcu in 2004. It is named after Buenos...

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

algorithms Searching in balanced binary search trees Exponentiation by squaring Longest increasing subsequence Binary logarithms also occur in the exponents...