Question

what is Red Black Tree

Answer 1

A red–black tree is a type of self-balancing binary search tree, a data structure used in computer science, typically to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer[1] and named "symmetric binary B-tree," but acquired its modern name in a paper in 1978 by Leonidas J. Guibas and Robert Sedgewick.[2]

Source: http://en.wikipedia.org/wiki/Red%E2%80%93black_tree

btw..this is probably not a good place for that question ;D we have a computer related group here...

Answer 2

hw do i post it on computer group?