Question

1. Using the Red-Black Tree applet, you input the following numbers into the Red-Black tree, keep all red-black rules (on page 433) either using color changes or rotation. The result graph should be height balance and red-black correct. (20 pts)

Attach your results of screen shots for every question.

1. Insert 50, 70, 20, 90

2. Insert 50, 70, 20, 90, 99

3. Insert 50, 70, 20, 90, 80

4. Insert 50, 70, 20, 80, 60, 90, 75, 95

5. Insert 50, 70, 20, 90, 60, 55, 65, 68

2. Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x %10 (table size is 10), showing the resulting (20 pts)
   1. Separate chaining hash table
   2. Open addressing hash table using linear probing.
   3. Open addressing hash table using quadratic probing.
   4. Open addressing hash table with second hash function h2(x) = 7- (x %7)

Answer 1

Following are the final RED-BLACK trees.

1.

2.

3.

4.

5.

Friend: As a Chegg expert, I am obliged to do only four parts of the question, but I still completed five of them.
I hope you understand, You can re-post the remaining of them.
Thanks