on online algorithms for binary search trees involves reformulating the problem geometrically, in terms of augmenting a set of points in the plane with...

complexity of operations on the binary search tree is linear with respect to the height of the tree. Binary search trees allow binary search for fast lookup...

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

n {\displaystyle n} of items. This is the case for many binary search trees, such as AVL trees and red–black trees. Splay trees and treaps are self-balancing...

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

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

not binary search trees. Bayer called them a "symmetric binary B-tree" in his paper and later they became popular as 2–3–4 trees or even 2–3 trees. In...

range searches and nearest neighbor searches) & Creating point clouds. k-d trees are a special case of binary space partitioning trees. The k-d tree is a...

Tutorial on Binary Space Partitioning Trees". BSP trees presentation Another BSP trees presentation A Java applet that demonstrates the process of tree generation...

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

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

theory of optimal binary search trees, the interleave lower bound is a lower bound on the number of operations required by a Binary Search Tree (BST) to...

Constructive solid geometry (CSG; formerly called computational binary solid geometry) is a technique used in solid modeling. Constructive solid geometry allows a...

analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees". Acta Informatica. 9 (1): 23–29. doi:10...

structure can be used, such as simple one dimensional arrays, binary search trees, B-trees, skip lists or (with low significant bits truncated) hash tables...

binary search trees. The Shamos–Hoey algorithm applies this principle to solve the line segment intersection detection problem, as stated above, of determining...

science) Trees can also be represented radially: Kinds of trees B-tree Dancing tree Decision tree Left-child right-sibling binary tree Porphyrian tree Tree (data...

time. Range trees in higher dimensions are constructed recursively by constructing a balanced binary search tree on the first coordinate of the points...

the n! conjecture. He is also the namesake of the Garsia–Wachs algorithm for optimal binary search trees, which he published with his student Michelle...

k being the number of retrieved intervals or segments. Applications of the segment tree are in the areas of computational geometry, geographic information...

for completeness, but they have been surpassed by k-d trees as tools for generalized binary search. Point quadtrees are constructed as follows. Given the...

article). The correct position of segment s in the binary search tree may be determined by a binary search, each step of which tests whether p is above...

of binary searches for the same value in a sequence of related data structures. The first binary search in the sequence takes a logarithmic amount of...

Bentley, Jon (1975). "Multidimensional binary search trees used for associative searching". Communications of the ACM. 18 (9): 509–517. doi:10.1145/361002...

product, a direct product of two sets Cartesian product of graphs, a binary operation on graphs Cartesian tree, a binary tree in computer science Cartesian...

than a traditional self-balancing binary search tree, and also better than the van Emde Boas tree for large values of w. It achieves this speed by using...

between two binary trees with the same number of nodes is the minimum number of tree rotations needed to reconfigure one tree into another. Because of a combinatorial...

Common Ancestor of a Binary Search Tree, by Kamal Rawat Python implementation of the algorithm of Bender and Farach-Colton for trees, by David Eppstein...

Cartesian tree for a sequence can be constructed in linear time. Cartesian trees are defined using binary trees, which are a form of rooted tree. To construct...

traversal of BIH resembles that of kd-trees. Furthermore, BIH are also binary trees just like kd-trees (and their superset, BSP trees). Finally, BIH is axis-aligned...