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

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 self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number...

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

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

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

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

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

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

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

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

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

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

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

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

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

insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. By allowing...

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

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

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

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

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

Randomized binary search tree Red–black tree Rope Scapegoat tree Self-balancing binary search tree Splay tree T-tree Tango tree Threaded binary tree Top tree Treap...

tree or prefix tree, is a specialized search tree data structure used to store and retrieve strings from a dictionary or set. Unlike a binary search tree...

assumes specifically a binary tree.) A level-order walk effectively performs a breadth-first search over the entirety of a tree; nodes are traversed level...

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

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

practical dominance over other sorting algorithms. The following binary search tree (BST) corresponds to each execution of quicksort: the initial pivot...

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