Problems

7) e and f

In java language

PART I 7) Given the following list of valucs: 45, 54, 89, 32, 23, 58, 65, 76, 88, 55, 42, 12, 38, 34, 57, 79, 90, 66 a) Draw the binary search tree that would evolve by inserting the values into the tree in the order in which they are presented b) Draw the array representation of this binary search tree. You may use .. notation as long as you label the array cells c) In what order would you insert the values so as to get a complete binary search tree? d) In what order would you insert the values so as to get a linked list that uses left references only? Right references only? e) How many elements would be needed for each of the binary trees described in part d if implemented as arrays? D Why are binary search tree more often implemented using linked structures rather than arrays