Given a set of 9 letters { H, K, S, P, A, E, I, 0, U }, answer the following: a) Draw a binary search tree which is also a complete binary tree, constructed with the letters of the given set above...

Only need question D

d) Find the average search length of the updated binary search tree in step c) with 2 decimal places, assume all nodes in the tree have same probability in searching. Clearly show the steps of your calculation.

Extracted text: Given a set of 9 letters { H, K, S, P, A, E, I, 0, U }, answer the following: a) Draw a binary search tree which is also a complete binary tree, constructed with the letters of the given set above (based on alphabetical ordering). b) Determine and list the sequence of elements obtained by post-order traversing the binary NO steps required. search tree constructed above. NO steps required. c) A new letter N is first inserted into the binary search tree determined above, followed by inserting another letter M. The original letter K is then removed from the binary search tree. Draw the updated binary search tree after these insertions and removal. NO steps required.