Red Black tree java code : Insertion , deletion

A red black tree is a binary tree that satisfies the following red-black properties

• Every node is either red or black
• The root is black
• Every leaf(NIL) is black
• If a node is red, then both its children are black
• For each node, all simple paths from the node to descendant leaves contains the same number of black nodes.