Question

What is the advantage of the Red Black tree? Why are we heading to that tree, when we have lot more? in what applications these are used?

Answer 1

http://en.wikipedia.org/wiki/Red –black_tree

Answer 2

A red black tree guarantees faster tree queries without increasing the time of other operations.

If you know about big-O notation, all you need to know is that a regular binary search tree has a worst case query time of O(n) and a red-black tree is a special case of a binary search tree with a query time of O(lg(n)).

I work as a software engineer and this is probably the simplest implementation of a binary search tree that guarantees O(lg(n)) queries.