| Which of the following data structure can provide efficient searching of the elements?
Choose the correct option from below list
(1)binary search tree
(2)unordered lists
(3)2-3 tree
(4)treap
Answer:-(3)2-3 tree
Note:-The average case time for lookup in a binary search tree, treap and 2-3 tree is O(log n) and in unordered lists it is O(n) | | |