private static Node createBlackNode(int data) {
        Node node = new Node();
        node.data = data;
        node.color = Color.BLACK;
        node.left = createNullLeafNode(node);
        node.right = createNullLeafNode(node);
        return node;
    }
Date 10/29/2015
@author Tushar Roy

Red Black Tree

Time complexity
Insert - O(logn)
Delete - O(logn)
Search - O(logn)

Does not work for duplicates.

References
http://pages.cs.wisc.edu/~skrentny/cs367-common/readings/Red-Black-Trees/
https://en.wikipedia.org/wiki/Red%E2%80%93black_tree
src/com/interview/tree/RedBlackTree.java