Question: 6 4 7 Lab #3 1) Write a program that creates and manages a Red-Black tree. The program must implement the following operations: creation, insertion,


6 4 7 Lab #3 1) Write a program that creates and manages a Red-Black tree. The program must implement the following operations: creation, insertion, deletion and print tree. The program should present a menu where user may choose from implemented options. 2) Consider a sample Red-Black tree with 5 nodes 5 Perform the following operations on the above-mentioned B- tree: Insert key 19; Insert key 18; Insert key 17; Delete key 6; Delete key 4; Delete key 19; For each insertion/deletion operation ask users to do the operations and print the results 6 4 7 Lab #3 1) Write a program that creates and manages a Red-Black tree. The program must implement the following operations: creation, insertion, deletion and print tree. The program should present a menu where user may choose from implemented options. 2) Consider a sample Red-Black tree with 5 nodes 5 Perform the following operations on the above-mentioned B- tree: Insert key 19; Insert key 18; Insert key 17; Delete key 6; Delete key 4; Delete key 19; For each insertion/deletion operation ask users to do the operations and print the results 6 4 7 Lab #3 1) Write a program that creates and manages a Red-Black tree. The program must implement the following operations: creation, insertion, deletion and print tree. The program should present a menu where user may choose from implemented options. 2) Consider a sample Red-Black tree with 5 nodes 5 Perform the following operations on the above-mentioned B- tree: Insert key 19; Insert key 18; Insert key 17; Delete key 6; Delete key 4; Delete key 19; For each insertion/deletion operation ask users to do the operations and print the results 6 4 7 Lab #3 1) Write a program that creates and manages a Red-Black tree. The program must implement the following operations: creation, insertion, deletion and print tree. The program should present a menu where user may choose from implemented options. 2) Consider a sample Red-Black tree with 5 nodes 5 Perform the following operations on the above-mentioned B- tree: Insert key 19; Insert key 18; Insert key 17; Delete key 6; Delete key 4; Delete key 19; For each insertion/deletion operation ask users to do the operations and print the results
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
