Binary trees

tree data structure in which each node has at most two children

data structure in tree form with 0, 1, or 2 children per node, sorted for fast lookup

entropy encoding algorithm used for lossless data compression

self-balancing binary search tree data structure

one kind of self-balancing binary search tree

heap data structure that takes the form of a binary tree

self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again

method for recursively subdividing a space into two subsets using hyperplanes

In computer science, the treap and the randomized 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 among the keys. After any sequence of insertions and deletions of keys, the shape of the tree is a random variable with the same probability distribution as a random binary tree; in particular, with high probability its height is proportional to the logarithm of the number of keys, so that each search, insertion, or deletion operation takes logarithmic time to perform.

operation that rebalances a binary tree without changing the inorder sequence of its nodes

tree data structure used in computer science

any node-based binary search tree that automatically keeps its height small

type of self-balancing binary search tree

binary tree derived from a sequence of numbers

binary tree variant that allows fast traversal

thumb|right|251px|An example T-tree

data structure representing a long string as a tree of separate substrings to permit efficient random insertions and deletions

heap data structure implemented as a binary tree