14) As in any searchable data structure, the insertion and removal in a skip-list rely heavily on the search fea- ture. Search begins at (-x / 0 / +x ) on the (bottom / top ) level. The search ends on the bottom top) level when the item is found or an upper-bounding value is reached. 15) Skijp-ists are nearly a drop-in replacement for any array-like application but sacrifice_(o(1) / Ologn)O)) lookup time for o(1) o(logn O(n time lookup. This sacrifice improves the general insertion and re- moval times from o(1)1 O(logn) O(n)) to (o(n) Ollogn) 1 O(n) ) A worthy tradeoff, indeed. 16) A binary search tree follows what node invariant? A) the data in the node is larger than the children's data B) the data in the node is smaller than the children's data C) the data in the left child is heavier than the data in the node and the data in the right child is lighter D) the data in the left child is smaller than the data in the node and the data in the right child is larger E) the data in the node is the average of the data in the children 17) Most operations on a binary search tree are logarithmic as long as what tree property is kept balanced? A) tree height node depth C) tree width D) tree weight E) node weight