Skip to Main Content
Data Structures using C, 2nd Edition
book

Data Structures using C, 2nd Edition

by A. K. Sharma
June 2013
Intermediate to advanced content levelIntermediate to advanced
516 pages
11h 21m
English
Pearson India
Content preview from Data Structures using C, 2nd Edition

4

Stacks and Queues

CHAPTER OUTLINE
4.1 STACKS

We are familiar with arrays and the operations performed on them. The various elements can be accessed from any position in a list, stored in an array. Some practical applications require that the additions or deletions be done only at one end. For example, the packets of wheat floor received in a super bazaar are put on top of another in the order of their arrival. Now, a customer can remove only the packet currently lying on the top, i.e., the last packet arrived in the bazaar is the first one to leave. The second customer would get the second last packet and so on. In the mean time, if more packets arrive then they will be added on the current ...

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

Introduction to Data Structures in C

Introduction to Data Structures in C

Ashok Kamthane
Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey

Publisher Resources

ISBN: 9789332524248