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

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

probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees. Different distributions have...

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

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

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

A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binary expression tree...

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.: 162–163 ...

search extends binary search to unbounded lists. The binary search tree and B-tree data structures are based on binary search. Binary search works on...

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 following algorithms are described for a binary tree, but they may be generalized to other trees as well. Unlike linked lists, one-dimensional arrays...

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

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

single straight line (called edge or link between two adjacent nodes). Binary trees are a commonly used type, which constrain the number of children for...

left-child, right-sibling binary tree, doubly chained tree or filial-heir chain. In a binary tree that represents a multi-way tree T, each node corresponds...

science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors. A free tree or unrooted tree is a connected undirected...

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

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

A Fenwick tree or binary indexed tree (BIT) is a data structure that stores an array of values and can efficiently compute prefix sums of the values and...

WAVL tree Weight-balanced tree Zip tree B-tree B+ tree B*-tree Dancing tree 2–3 tree 2–3–4 tree Queap Fusion tree Bx-tree Heap Min-max heap Binary heap...

traditional binary tree, but with extra logic to support searching the intervals overlapping the "center" point at each node. For each tree node, x {\displaystyle...

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

& 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 node is a k-dimensional...

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

the minimum spanning tree for those weights Random binary tree, binary trees with various random distributions, including trees formed by random insertion...

part of a given binary hash tree requires computing a number of hashes proportional to the logarithm of the number of leaf nodes in the tree. Conversely,...

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

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

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