1. You have the following binary search tree. Perform the following operations on the tree Draw the tree after every operation is performed a. (25 points) Insert 95, Insert 49 b. (25 points) Remove 61 c. (25 points) Insert 22, Insert 71 d. (25 points) Remove 75 The operations must be applied consecutively one after another. That is, insert 95 to the tree, insert 49, then remove 61 from the tree that contains 95 and 49, thereafter insert 22, so and so forth. Grading Rubric: Correctness (100 points) (no partial credit will be given) 50,25, 61,12, 30, 55, 75, 70 90, 50 53 25 12 30 75 50 70 90

1. You have the following binary search tree. Perform the following operations on the tree Draw the tree after every operation is performed a. (25 points) Insert 95, Insert 49 b. (25 points) Remove 61 c. (25 points) Insert 22, Insert 71 d. (25 points) Remove 75 The operations must be applied consecutively one after another. That is, insert 95 to the tree, insert 49, then remove 61 from the tree that contains 95 and 49, thereafter insert 22, so and so forth. Grading Rubric: Correctness (100 points) (no partial credit will be given) 50,25, 61,12, 30, 55, 75, 70 90, 50 53 25 12 30 75 50 70 90



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *