Implement a red-black tree with no deletion in java. Insert

// Inserts the element into the red-black tree Contains

// Returns true if the element is in the tree else returns false. Print Tree

//Prints the entire tree in order with * before the red elements.

You have to include a link to the parent node to perform insertion bottom up. The nested tree node class will look like the following

private static class RBTreeNode { int element; RBTreeNode left; RBTreeNode Right;

RBTreeNode parent; boolean isRed; .... }

Include appropriate routines to do insertion and to rectify double red scenarios. Sample Run

1. Insert

2. Contains

3. Print Tree

Your Option: 1

Element: 8

Element inserted

Your Option: 1

Element: 10

Element Inserted

Your Option: 1

Element: 5

Element Inserted

Your Option: 3

RB Tree: *5 8 *10

Your Option: 1

Element: 6

Element Inserted

Your Option: 3

RBTree: 5*6810

Your Option: 1

Element: 15

Element Inserted

Your Option:1

Element: 20

Element Inserted

Your Option: 3