Suppose we want to design a system for storing employee records keyed using phone numbers. We can think of using the following data structures to maintain information about different phone numbers. Fo...Suppose we want to design a system for storing employee records keyed using phone numbers. We can think of using the following data structures to maintain information about different phone numbers. For arrays and linked lists, we need to search in a linear fashion, which can be costly in practice. If we use arrays and keep the data sorted, then a phone number can be searched in O(Logn) time using Binary Search, but insert and delete operations become costly as we have to maintain sorted order.
