Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
Linear Data Structure 489
Fig. 14.12 shows that insertion is done at the rear end and deletion at the front end.
p
Q
R
S
(a)
Front
Q R
Rear
(b)
Q R
(c)
Fig. 14.13 Queues
Fig. 14.13 illustrates queue containing elements. Queue (a) contains four elements P, Q, R and S.
The element P is at the front end and element S is at the rear end. In (b), element P has been deleted
from the queue. The element Q is now the first element and now it is in the front. In (c) elements S
and T are inserted. The elements are inserted from the rear end of queue. The element S is inserted
before T. As far as removal operation is concerned, S is to be removed before T.
Freq
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343