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....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-tre
to programming tree algorithms reference database data_structure algorithm by fmeyer on Oct 24, 2007, 8:33 PM
