First page Back Continue Last page Summary Graphic
Introduction
A Queue is a data structure in which all insertions are made at one end (rear) of an ordered list, while all deletions are made at the opposite end (front). The first entry which is inserted is the first one that will be removed.
Sometimes referred to as First-In-First-Out (LIFO)
Notes: