Algorithms and Data Structures 1: Linked List 00:42:29
Introduction 00:01:04
Node Chains 00:02:23
Code: Node Chains 00:05:05
Linked List 00:00:40
Add Items 00:04:04
Remove Items 00:01:54
Enumerate 00:01:32
Code: Singly Linked List 00:11:16
Doubly Linked List 00:01:54
Code: Doubly Linked List 00:08:30
Modern Implementations 00:02:57
Summary and References 00:01:10
Algorithms and Data Structures: Stack 00:30:21
Introduction 00:01:06
Push & Pop 00:02:46
Stack (Linked List) 00:02:45
Code: Stack (Linked List) 00:01:34
Stack (Array) 00:01:38
Code: Stack (Array) 00:04:32
Postfix Calculator 00:03:35
Demo: Postfix Calculator 00:03:28
Demo: Undo 00:06:28
Other Implementations 00:01:47
Summary and Reference 00:00:42
Algorithms and Data Structures 1: Queue 00:31:59
Introduction 00:00:59
Enqueue and Dequeue 00:03:00
Linked List Implementation 00:02:13
Code: Linked List Implementation 00:02:04
Demo: Queue 00:03:24
Array Implementation 00:03:47
Code: Array Implementation 00:08:11
Priority Queue 00:01:51
Code: Priority Queue 00:02:38
Demo: Priority Queue 00:02:06
.NET and C++ 00:01:02
Summary and Reference 00:00:44
Algorithms and Data Structures: Binary Trees 00:44:07
Introduction 00:00:44
What is a Tree? 00:03:00
Binary Trees 00:02:33
Adding Data 00:02:34
Finding Data 00:03:49
Removing Data 00:07:25
Traversals 00:06:25
Code: Binary Tree 00:14:41
Demo: Sorting Words 00:02:02
Summary 00:00:54
Algorithms and Data Structures: Hash Tables 00:44:19
Introduction 00:00:48
Hash Tables 00:02:36
Hashing Overview 00:04:20
String Hashing 00:06:45
Demo: String Hashing 00:04:03
Adding Data 00:01:15
Handling Collisions 00:02:53
Growing the Table 00:02:40
Removing Data 00:02:43
Finding Data 00:01:19
Enumerating 00:01:15
Code: Hash Table 00:08:13
Demo: Counting Words 00:04:18
Summary 00:01:11