Data Structures for Absolute Beginners in Python

Course Curriculum

Chapter 1: Introduction

Lecture 1: What this course is about

Lecture 2: How to take the course effectively

Chapter 2: Environment Setup

Lecture 1: Setting up your environment

Chapter 3: Stacks and Queues

Lecture 1: Section Introduction

Lecture 2: Stack

Lecture 3: Stack Implementation

Lecture 4: Valid Brackets Problem

Lecture 5: Valid Brackets Problem solution

Lecture 6: Queues

Lecture 7: Queue Implementation

Lecture 8: Section Conclusion

Chapter 4: Singly Linked Lists

Lecture 1: Section Introduction

Lecture 2: Introduction to Linked Lists

Lecture 3: Singly Linked List Implementation

Lecture 4: Singly Linked List: Push Method

Lecture 5: Singly Linked List: Unshift Method

Lecture 6: Singly Linked List: Shift Method

Lecture 7: Singly Linked List Traversal

Lecture 8: Singly Linked List Pop

Lecture 9: Singly Linked List Insert

Lecture 10: Singly Linked List Remove

Lecture 11: Singly Linked List Reverse

Lecture 12: Singly Linked Lists: Conclusion

Chapter 5: Doubly Linked Lists

Lecture 1: Section Introduction

Lecture 2: Doubly Linked Lists: Introduction

Lecture 3: Doubly Linked Lists: Implementation

Lecture 4: Doubly Linked Lists: Push Method

Lecture 5: Doubly Linked Lists: Unshift Method

Lecture 6: Doubly Linked Lists: Shift Method

Lecture 7: Doubly Linked Lists: Pop Method

Lecture 8: Doubly Linked Lists: Insert Method

Lecture 9: Doubly Linked Lists: Remove

Lecture 10: Doubly Linked Lists: Reverse

Lecture 11: Doubly Linked Lists: Conclusion

Chapter 6: Binary Search Trees

Lecture 1: Section Introduction

Lecture 2: Binary Search Trees: Introduction

Lecture 3: Binary Search Trees: Implementation

Lecture 4: Binary Search Trees: Insertion Introduction

Lecture 5: Binary Search Trees: Insertion Implementation (Iterative)

Lecture 6: Binary Search Trees: Insertion Implementation (Recursive)

Lecture 7: Binary Search Trees: Preorder Traversal (Part 1)

Lecture 8: Binary Search Trees: Preorder Traversal Part 2

Lecture 9: Binary Search Trees: Inorder Traversal

Lecture 10: Binary Search Trees: Postorder Traversal

Lecture 11: Binary Search Trees: Delete Explanation

Lecture 12: Binary Search Trees: Delete Implementation

Lecture 13: Binary Search Trees: Search

Lecture 14: Binary Search Trees: Conclusion

Chapter 7: Graphs

Lecture 1: Section Introduction

Lecture 2: Graphs: The Basics

Lecture 3: Graphs: Implementation

Lecture 4: Graphs: Breadth First Search

Lecture 5: Graphs: Depth First Search

Lecture 6: Graphs: Conclusion

Chapter 8: Computational Complexity

Lecture 1: Section Introduction

Lecture 2: Big O Notation: Introduction

Lecture 3: Big O: Arrays

Lecture 4: Big O: Stacks and Queues

Lecture 5: Big O: Linked Lists

Lecture 6: Big O: Binary Search Trees

Lecture 7: Big O: Graphs

Lecture 8: Big O: Conclusion

Chapter 9: Course Conclusion

Lecture 1: Course Conclusion and what's next