In: Computer Science
If you have an application that only needs to retrieve items from a very large dictionary,
and it never needs to insert or delete new items, which implementation would be the
most efficient? Justify your assertion.
solution:
I would suggest you to go with B-Tree or Red-Black Tree or AVL
Tree.
The average access time for all the above data structures is
theta(log n)
The worst case access time is also O(log n).
Not only access but also search, insertion, deletion is also same in both the cases.