Skip to Main Content
Python Programming: A modular approach
book

Python Programming: A modular approach

by Kumar Naveen, Taneja Sheetal
January 2017
Intermediate to advanced content levelIntermediate to advanced
606 pages
14h 1m
English
Pearson Education India
Content preview from Python Programming: A modular approach

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. ...

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

Modular Programming with Python

Modular Programming with Python

Erik Westra
Python Programming Blueprints

Python Programming Blueprints

Daniel Furtado, Marcus Pennington

Publisher Resources

ISBN: 9789352866038