Data Structure Selection.

You must keep track of some data items. Your options are:

1. A singly linked list. Upon insertion the list is searched so the item can be placed in the proper location to maintain sorted order.
2. A binary search tree.

For the following scenarios which of these options is best? Justify your selection.

1. The items arrive with values having a uniform random distribution. n insertions are performed, followed by lg n searches.

2. The items are guaranteed to arrive already sorted from highest to lowest (i.e., whenever an item is inserted, its key value will always be less than that of the last record inserted). A total of n insertions are performed, followed by lg n searches.