(i) Draw the binary search tree after deleting the key 30. (ii) Draw the binary search tree after deleting...

 

Transcribed Image Text:

(i) Draw the binary search tree after deleting the key 30. (ii) Draw the binary search tree after deleting the key 48 from the resultant binary search tree in part (b) (i) of this question. (iii) Draw the binary search tree after deleting the key 20 from the resultant binary search tree in part (b) (ii) of this question. (c) Explain why the time complexity of the operation of deleting a key in a binary search tree is O(h) where h is the height of the binary search tree. The following figure shows a binary search tree. 5 8 13 16 20 25 30 48 (85

Answer rating: 100% (QA)

1 ii iii G 8 16 13 20 16 25 25 85 85 The tim View the full answer