4. Stacks and Queues
In This Chapter
• Different Structures for Different Use Cases
• Stacks
• Queues
• Parsing Arithmetic Expressions
This chapter examines three data storage structures widely used in all kinds of applications: the stack, the queue, and the priority queue. We describe how these structures differ from arrays, examining each one in turn. In the last section, we look at an operation in which the stack plays a significant role: parsing arithmetic expressions.
Different Structures for Different Use Cases
You choose data structures to use in programs based on their suitability for particular tasks. The structures in this chapter differ from what you’ve already seen in previous chapters in several ways. Those differences ...
Get Data Structures & Algorithms in Python now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
