Inspect the following set of numbers, S = {20, 10,30,25,8,35,4,9,33,16,23,18,17,12). All operations are performed in the...

 

Transcribed Image Text:

Inspect the following set of numbers, S = {20, 10,30,25,8,35,4,9,33,16,23,18,17,12). All operations are performed in the order that they are asked on the same binary search tree, i.e. insert in a), keep the tree in its current state and delete in d), keep tree state and delete in e) and so forth. a. Insert the set S into a binary search tree. Draw a diagram to illustrate the result. b. Calculate the height (h) of the tree. c. What is the Big-Oh complexity of the tree in its current form? Briefly motivate? d. Delete the element with the value of 12 from the tree. Draw the resulting tree. Delete the element with the value of 35 from the tree. Draw the resulting tree. Consider how the tree looks at this point. Delete the element with the value of 10 from the tree. e. f. i. Draw the resulting tree if you replace a node with the in-order predecessor. ii. Draw the resulting tree if you replace a deleted node with the in-order successor. Inspect the following set of numbers, S = {20, 10,30,25,8,35,4,9,33,16,23,18,17,12). All operations are performed in the order that they are asked on the same binary search tree, i.e. insert in a), keep the tree in its current state and delete in d), keep tree state and delete in e) and so forth. a. Insert the set S into a binary search tree. Draw a diagram to illustrate the result. b. Calculate the height (h) of the tree. c. What is the Big-Oh complexity of the tree in its current form? Briefly motivate? d. Delete the element with the value of 12 from the tree. Draw the resulting tree. Delete the element with the value of 35 from the tree. Draw the resulting tree. Consider how the tree looks at this point. Delete the element with the value of 10 from the tree. e. f. i. Draw the resulting tree if you replace a node with the in-order predecessor. ii. Draw the resulting tree if you replace a deleted node with the in-order successor.