Question

When the amount of storage data is big, and we need the searching and insertion must be very fast, which kind of data structure we should consider? a. Hash table b. Binary tree c. Array d. Linked Lists

Answer 1

b. Binary tree

Step-by-step explanation:

The time complexity of a binary tree is O(log n). As it scales up in size (n), the time taken is only log n. This is because it makes use of divide and conquer to split up the data which makes searching and inserting very simple. However, this only holds if the data is already sorted.