Data Structures Using C, 2nd Edition by Pearson

170 Data Structures Using C

4.3 QUEUES

A queue is the most common situation in this world where the

first person in the line is the person to be served first; the new

comers join at the end. We find that in this kind of arrange-

ment, all additions are made at one end and the deletions made

at the other. The end where all additions are made is called the

rear end. The other end from where the deletions are made is

called the front end as shown in Figure 4.8.

The queue is also a linear data structure of varying size

in the sense that the size of a queue depends upon the num-

ber of items currently present in it. With additions and/

or