Ask 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

+3
Answers (1)
  1. 24 July, 08:30
    0
    b. Binary tree

    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.
Know the Answer?
Not Sure About the Answer?
Find an answer to your 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 ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers