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
B. Kadar, P. Szeredi, and G. Lukacsy. Proceedings of the 3rd International Workshop on Applications of Logic Programming to the (Semantic) Web and Web Services (ALPSWS2008), Udine, Italy, volume 434 of CEUR Workshop Proceedings, Sun SITE Central Europe, (2009)
K. Bhagwat, P. Salunkhe, and S. Bangar. International Journal on Recent and Innovation Trends in Computing and Communication, 3 (2):
537--541(February 2015)