A red–black tree is a special type of binary search tree, used in computer science to organize pieces of comparable data, such as text fragments or numbers (as e.g. the numbers in figures 1 and 2).The nodes carrying keys and/or data are frequently called internal nodes, but in order to make this very specific they are also called nonNIL nodes in this article.
Download Image:
clickdownload
and right mouse click and Save image As...on new page
