Implement insertion and deletion for a red-black tree as defined in class.

Note that insertion should check for duplicate keys, and when there is no such key after exhausting the

input in case of deletion, display the key does not exist.

Input:

list of pairs of an integer and an operation, e.g., 1.in 3.in 5.in 3.del 2.in .....

/* Notice that pairs are delimited by a single space in between. Note that input is to be read in

from a file in a batch. */

Output:

The tree before operation in in-order traversal and the tree in an in-order traversal after

operation displayed on the screen standard outout (not into a file).

If a duplicate key is inserted display duplicate key, and reject it.

Any other way different then note it in the README file.

A command line user interface has to be provided as follows:

Enter your input file name:

Display the tree before (in-order): /* display the input integers following a statement */

Display the tree after the operation (in-order): /* display the resulting output on the screen */