Answer to Question #292908 in C++ for Anna

Question

Hospitals mainly treat patients who are mentally ill and paralyzed. The percentage of patients for follow-up visits is still very high compared to newly admitted patients. Due to the wide and comprehensive range of services, managing patient orders is still a problem for patients with long treatment periods. Due to this high threshold for patient care, the system needs to be upgraded to function efficiently. For that we need a system that can quickly find new patients so that they have time to make observations/reviews. But due to its widespread use, the current system is unable to treat patients effectively.

Question:

From doubly linked list and singly linked list data structures which data structure you will choose for the upgradation of the system?

Answer 1

 Doubly linked list data structures. When it comes to time complexity, Doubly Linked Lists are the most efficient in all main activities and operations. All operations on Doubly Linked Lists are performed in constant time, with the exception of access by index, which is performed in linear time (n) because it must iterate through each node to reach the required index. Insert, Remove, First, Last, Concatenation, and Count are all done in real time with a Doubly Linked list. Because the hospital has a huge amount of data, this would make it easier to detect new patients and do observation and review procedures.

The elements of a singly linked list can only be traversed in one direction.