Added implmentation of Red Black Tree

[harsh-2711]

Concept Description -

Red-Black Tree is a self-balancing Binary Search Tree (BST) where every node follows following rules:

1. Every node has a color either red or black.
2. Root of tree is always black.
3. There are no two adjacent red nodes (A red node cannot have a red parent or red child).