Data Structures

Question

Arrange the following Data-structures in the non-decreasing order of worst case time complexities on the operation $Search$

Binary Search Trees, Linked List, Array, Hash Table

Comments

Array: $O(n)$

Binary Search Trees: $O(n)$

Linked List: $O(n)$

Hash Table: $O(n)$

More than one order is possible.

---

Actually I know the answer, but this question is present in the mock test of IIIT HYDERABAD PGEE, and as you might guess, none of the options were correct

Answer 1

Hope this is clear