Question

Which data structure to use for fastest search?

Answer 1

Self-balancing binary search tree
----------------------------------------------------------------------------------------------------------------

Self-balancing binary search tree is use for fastest search.

===================================================


1) It's search is O (log n)

2) And 2nd best is heap .

Answer 2

Heya,

your answer is here -

Self-balancing binary search tree

HOPE IT HELPS YOU