Red Black Tree

self balancing search tree (BST)

- every node has a color either black or red

- root node is always black

- no two adjacent red nodes. red node always have black children if any

- the numbers of black nodes from root to every leaves (NULL nodes) are same

The least height of tree is log(n). The tree needs to be maintained for height of log(n) after addition and deletion. tree can be balanced with rearranging and recoloring which are peformed efficiently than AVL tree.

references http://www.geeksforgeeks.org/red-black-tree-set-1-introduction-2/