English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 1h 2m | 129 MB
In this course, get an introduction to linked lists, a popular and useful dynamic Python data structure. Instructor Ryan Mitchell covers various types of linked lists, and gives you the opportunity to practice your skills with CoderPad challenges in each chapter. Ryan starts with the basics—how Python lists are stored, the advantages and disadvantages, and how linked lists solve some of these problems. She shows you practical applications of linked lists, and how to build a linked list in Python. Then, find out how to build functionality like searching and sorting a linked list. Ryan then shows you how you can make circular linked lists, doubly-linked lists, and even orthogonal linked lists.
This course includes Code Challenges powered by CoderPad. Code Challenges are interactive coding exercises with real-time feedback, so you can get hands-on coding practice alongside the course content to advance your programming skills.
Table of Contents
Introduction
1 The best dynamic Python data structure Linked Lists
2 What You Should Know
3 Using CoderPad
Getting Started
4 Lists, Linked Lists, and Memory
5 Practical Applications of Linked Lists
6 Building a Linked List in Python
7 Solution Finding a middle ground
Building Functionality
8 Searching
9 Deleting Nodes
10 Inserting Nodes
11 Solution Removing duplicates
Variations on a Theme
12 Circular Lists
13 Doubly Linked Lists
14 Orthogonal Linked Lists
15 Solution Fixing a doubly-linked list
Conclusion
16 Next steps
Resolve the captcha to access the links!