Answer Happy

a problem domain of real-life world ((hospital))
Requirement 1. Represent each of the 5 problem
components with the best Data Structure suitable for it: Linked
List (Singly or Doubly), Stack, Queue, Tree, or Graph. You must
choose only one data structure for each of your problem components.
Justify your selection of Data Structures to represent the 5
problem components
Requirement 2. Explain how each of the data
structure techniques will be applied on each of the problem
components, in terms of Adding Elements, Traversing or Searching
for Elements, and Deleting Elements. Reinforce your answer with
illustrative drawings for more clarity.
Requirement 3. Write pseudocode for the operations
stated in Requirement 2 (Insertion, Deletion, Traversing and
Searching) for each of the problem components
Requirement 4. Analyze the complexity of your
pseudocode algorithms, and estimate the Big-O efficiency results
for them