4.1.4.1 Properties of Queue
Computational Structures
Below are the key properties of a queue.
- Order Preservation: A queue keeps track of the order of items. The first item you put in the queue is the first one to come out.
- FIFO Principle: A queue works on the “First-In, First-Out” rule. This means the first item added to the queue is the first one to be removed.
- Dynamic Size: A queue can grow or shrink in size as you add or remove items. It adjusts automatically based on the number of items it holds.