CHAPTER 14

DATA STRUCTURES II: LINKED LIST

CHAPTER OUTLINE

14.1 Introduction

14.2 Insertion and Deletion at the Beginning of a Linked List

14.3 Deleting a Node with a Particular Value from a Linked List

14.4 Traversing a Linked List

14.5 Maintaining Sorted Linked List while Inserting

14.6 Stack Implementation Using Linked List

14.7 Queue Implementation Using Linked List

In the previous chapter, we studied stacks and queues. Whereas a stack allows insertion and deletion of objects at one end, in a queue new objects are inserted at one end, and the deletion takes place from the other end. In this chapter, we will discuss a more flexible data structure called linked list that allows insertion and deletion of an object at an arbitrary position. ...

Get Python Programming: A modular approach now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.