of 9 letters { H, K, S, P, A, E, I, O, 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). NO steps required. b) Determine and list the sequence of elements obtained by post-order traversing the binary search tree constructed above. NO steps required.
Given a set of 9 letters { H, K, S, P, A, E, I, O, 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). NO steps required.
b) Determine and list the sequence of elements obtained by post-order traversing the binary 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.
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.
Step by step
Solved in 2 steps with 1 images
