The Inefficient Guys

A company has a record that consists of entries like this

Employee ID Name Detail 1 Detail 2 ...
1 Mr. X ... ... ...
2 Mr. Y ... ... ...
... ... ... ... ...

They are recently receiving requests for data about their employees from a government investigation department.

Records from the original database were accessed using the Employee ID as the key. However, due to the need of the investigators, we need to organize the data so that looking up names are fast enough.

Using which of the following data structures could the create an interface involving the Name s and the ID s, such that the above criteria is met?

Linked List Stack Queue Red-Black Trees

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...