? treap is n binary search tree that uses nindenization to prodice balmeed trees. In addition to boling key value, each node of, trap holdi mdmly chosen priority value. A node is inserted accoeding to regular binary search tree rules using its key value. Then any necessary rotations are perfomed so that the priceity values satisty the heap property: Each node other than the root has a priority that is no larger than the priority of its parent. Which of the following statements best describes the efficiency guaransees of a treup coetaining n nodes? OA) The randomiration ievalidales the basic binary search tree condition, so scarches may need to look at the whole tree, at a time cost of On) B) In order to guarantee Oflog n) lookups, the rebalancing requirements of an insertion may be expensive, requiring up to O) time to complete C) The randomization enables the system to ineert any node in constant time independent o i ut values and order D) The randomization means that one can expect O k n time freinhes uai insertions (on average E Having n key values and n priorities means that any lookups will require Xn') time. ? treap is n binary search tree that uses nindenization to prodice balmeed trees. In addition to boling key value, each node of, trap holdi mdmly chosen priority value. A node is inserted accoeding to regular binary search tree rules using its key value. Then any necessary rotations are perfomed so that the priceity values satisty the heap property: Each node other than the root has a priority that is no larger than the priority of its parent. Which of the following statements best describes the efficiency guaransees of a treup coetaining n nodes? OA) The randomiration ievalidales the basic binary search tree condition, so scarches may need to look at the whole tree, at a time cost of On) B) In order to guarantee Oflog n) lookups, the rebalancing requirements of an insertion may be expensive, requiring up to O) time to complete C) The randomization enables the system to ineert any node in constant time independent o i ut values and order D) The randomization means that one can expect O k n time freinhes uai insertions (on average E Having n key values and n priorities means that any lookups will require Xn') time