Introduction to Python Programming and Data Structures, 3rd Edition by Pearson

CHAPTER 18

Linked Lists, Stacks, Queues, and Priority Queues

 

Objectives

• To store a list using a linked structure (§18.2).
• To design the linked list class (§18.3).
• To implement the methods in the linked list class (§18.4).
• To show the difference between lists and linked lists (§18.5).
• To explore variations of linked lists (§18.6).
• To define and create iterators for traversing elements in a container (§18.7).
• To generate iterators using generators (§18.8).
• To design and implement stacks (§18.9).
• To design and implement queues (§18.10).
• To design and implement priority queues (§18.11).
• To parse and evaluate expressions using stacks (§18.12).

18.1 Introduction

Key Point

This chapter focuses on designing and implementing custom data structures. ...