Question

Suppose you have to build a software for a company. The software should have the capability to store, retrieve, update and delete information about its customers.

A large number of customers visit the company’s store every day and get registered. The date and the time of registration should be recorded automatically for customers at the time of their registration. Their information can be added (as they register), searched (if needed for any purpose), updated (if any change in their status) and removed (if they quit their registration) from the system. The system should have capability to traverse the customers’ records on the basis of the dates and times when they were added into the system.

Considering this scenario, which data structure do you think would work the best when fast insertion of a new customer is the key requirement of the system?

Justify your selection of data structures with strong arguments.

You have the following data structures as options to choose from:

Linked List:
Binary Search Tree
Heap


Instructions:

Your answer should not exceed 3 – 4 lines of text in justification of your selected data structure.
A concise, coherent and to the point answer is preferred over lengthy comment having irrelevant details.
Answers, posted on regular Lesson's MDB or sent through email will NOT be considered in any case.

Answer 1

Answer:-

Linked List is Good of this purpose  

Reason:-

A Linked List is good for inserting and removing list items swiftly, not just at the ends of the list but also in the middle. Linked list is the best and fast data structures of the system supplies

Because linked list is a dynamic data structure so it can grow and shrivel at runtime by allocating and de-allocating memory. Insertion and deletion of nodes are really easier. No Memory consumption also the other best aspect is that implementation is easy in linked list

BE YOURS............^_^

Answer 2

Answer:-

Linked List is Good of this purpose