bobbiemartinez75441 bobbiemartinez75441 15-04-2024 Computers and Technology contestada Which data structure does not support unsuccessful search in O(log2n) time in the worst case.- AVL trees- Red-Black trees- 2-4 trees- Skip lists