Data Structures 2022 Clearly Explained Beginner to Advanced

Course Curriculum

Chapter 1: Introduction

Lecture 1: Quick Introduction Article!

Lecture 2: Introduction Video

Lecture 3: Github

Chapter 2: Arrays

Lecture 1: Arrays Explained

Lecture 2: Arrays Coded

Lecture 3: 2D Arrays Explained

Lecture 4: 2D Arrays Coded

Lecture 5: Coding Exercise Solution: Reverse Array

Chapter 3: Linked Lists

Lecture 1: Singly Linked List Explained

Lecture 2: Singly Link List Coded

Lecture 3: Circularly Linked List Explained

Lecture 4: Circularly Linked List Coded

Lecture 5: Doubly Linked List Explained

Lecture 6: Doubly Linked List Coded

Lecture 7: Assignment Solution #2

Chapter 4: Stacks

Lecture 1: Stack Explained

Lecture 2: Stack Coded

Lecture 3: Stack Tested

Chapter 5: Queues

Lecture 1: Queue Explained

Lecture 2: Queue Coded

Lecture 3: Deque Explained

Lecture 4: Deque Coded

Chapter 6: Trees

Lecture 1: General Trees Explained

Lecture 2: General Tree Vocabulary Explained

Lecture 3: Binary Tree Explained

Lecture 4: Binary Search Tree Explained

Lecture 5: Binary Search Tree Example

Lecture 6: Tree Traversals Explained

Lecture 7: Binary Search Tree Coded – Insertion

Lecture 8: Binary Search Tree Coded – Deletion

Lecture 9: Binary Search Tree Coded – Height and Depth

Lecture 10: Tree Traversals Coded

Lecture 11: Binary Search Tree Test the Code!

Chapter 7: Heaps

Lecture 1: Heaps Explained

Lecture 2: Heap Example

Lecture 3: Heaps Coded

Lecture 4: Heaps Tested

Chapter 8: Balanceable Tree

Lecture 1: Balanceable Tree Class Coded Introduction

Lecture 2: Balanceable Tree Class Coded Searching

Lecture 3: Balanceable Tree Class Coded Insertion

Lecture 4: Balanceable Tree Class Coded Rotation

Lecture 5: Balanceable Tree Class Coded Deletion

Chapter 9: Skip List

Lecture 1: Skip List Explained

Lecture 2: Skip List Coded Introduction and Searching

Lecture 3: Skip List Coded Insertion

Lecture 4: Skip List Coded Deletion

Lecture 5: Skip List Test the Code!

Chapter 10: AVL Tree

Lecture 1: AVL Tree Explained

Lecture 2: Before you Code the AVL Tree

Lecture 3: AVL Tree Coded – Introduction

Lecture 4: AVL Tree Coded – Balanceable Methods

Lecture 5: AVL Tree Code Tested

Chapter 11: Splay Tree

Lecture 1: Splay Tree Explained

Lecture 2: Before you Code Splay Trees

Lecture 3: Splay Tree Coded

Lecture 4: Splay Tree Coded – Balanceable Methods

Lecture 5: Splay Tree Test the Code!

Chapter 12: Red Black Tree

Lecture 1: Red Black Tree Explained Intro

Lecture 2: Red Black Tree Explained Insertion

Lecture 3: Red Black Tree Explained Insertion – Case #1

Lecture 4: Red Black Tree Explained Insertion – Case #2

Lecture 5: Red Black Tree Explained Deletion

Lecture 6: Red Black Tree Explained Deletion – Case #1

Lecture 7: Red Black Tree Explained Deletion – Case #2

Lecture 8: Red Black Tree Explained Deletion – Case #3

Lecture 9: Before you Code Red-Black Trees

Lecture 10: Red Black Tree Coded

Chapter 13: Graphs

Lecture 1: Graphs Explained – Introduction

Lecture 2: Graphs Explained – Adjacency List

Lecture 3: Graphs Explained – Adjacency Map

Lecture 4: Graphs Explained – Adjacency Matrix

Lecture 5: Graph Traversals – Depth-First Search

Lecture 6: Graph Traversals – Breadth-First Search

Lecture 7: Graph Traversals – Dijkstra's Algorithm (Shortest Path)