a binary search tree data structure , ie most of the common
a binary search tree data structure , i
a binary search tree in which each node is colored red or black, and, for convenience, we consider the external leaf nodes as part of the tree when stating balance conditions
a binary search tree such that each node (internal and external) is assigned a color (either red or black)
a binary search tree where each node has a color attribute, the value of which is either red or black
a binary tree where each node has color as an extra attribute, either red or black
a form of balanced binary tree
a special type of binary tree , which is a structure used in computer science to organize pieces of comparable data , such as numbers
A form of balanced tree (see balanced tree) where each node has a color (see color) and these colors are laid out such that they satisfy rule 1 (see rule 1) and rule 2 (see rule 2) for red-black trees.
A red-black tree is a type of self-balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them "symmetric binary B-trees", but acquired its modern name in a paper in 1978 by Leo J. Guibas and Robert Sedgewick.
