9. Consider the following binary search tree (BST). 3 (15) (24 (a) List all the possible...

 

Transcribed Image Text:

9. Consider the following binary search tree (BST). 3 (15) (24 (a) List all the possible insertion orders (i.e., permutations) of the keys that could have produced this BST. (b) Draw the same BST after the insertion of keys: 6, 45, 32, 98, 55, and 69, in this order. (c) Draw the BST resulting from the deletion of keys 9 and 45 from the BST re- sulting from the previous question. 9. Consider the following binary search tree (BST). 3 (15) (24 (a) List all the possible insertion orders (i.e., permutations) of the keys that could have produced this BST. (b) Draw the same BST after the insertion of keys: 6, 45, 32, 98, 55, and 69, in this order. (c) Draw the BST resulting from the deletion of keys 9 and 45 from the BST re- sulting from the previous question.