Java Data Structures (Most Efficient Structure For Specific Program) : <p>Question from textbook exercise: </p>

<p>A hospital has a capacity of n patients. Each time a patient comes in he is assessed and, if in noncritical condition, has to wait his turn. If in critical condition, he is moved as the next to be treated. If a patient is in the washroom when called, he skips his turn and is treated as a new patient.
At any point in time, the hospital needs to know who is being treated, and what capacity there is left.</p>

<p>Would it be more efficient to solve this problem with (able to chose more than one answer):
1. deque
2. array
3. circuluar array
4. custom data structure: array + stack
5. stack</p>
