Python Data Structures: Stacks, Deques, and Queues

Python Data Structures: Stacks, Deques, and Queues

English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 0h 26m | 54 MB

Stacks, deques, and queues are three essential Python data structures. They form the backbone of many computer science algorithms, and showing a mastery of these concepts can help you in your current job or help you land your next role. In this course, Dhhyey Desai shows you how to build stacks, queues, and deques, and use these linear data structures to solve real-world problems you might encounter in your work. Learn how to define each class and use Python’s built-in methods to accomplish the necessary behaviors, such as push, pop, and peek; enqueue and dequeue; and add_front and remove_rear. Join Dhhyey in this course to learn the benefits of each of these common data structures, and add skills to your coding toolkit.

Table of Contents

1 Python data structures Stacks, queues, and deques
2 What you should know

3 Stacks An introduction
4 The push() operation
5 The pop() operation
6 The peek() operation

7 Queues An introduction
8 List-based queues
9 Stack-based queues
10 Node-based queues

11 Deques An introduction
12 Appending lists with deque
13 rotate(), reverse(), and extend()

14 Next steps