视频选集
（65/100）
Lesson 101. Singly Linked List Insert Intro
04:28
Lesson 102. Singly Linked List Insert Solution
07:50
Lesson 103. Singly Linked List Remove Intro
01:57
Lesson 104. Singly Linked List Remove Solution
03:16
Lesson 105. Singly Linked List Reverse Intro
04:47
Lesson 106. Singly Linked List Reverse Solution
08:59
Lesson 107. Singly Linked List BIG O Complexity
05:42
Lesson 108. Doubly Linked Lists Introduction
04:45
Lesson 109. Setting Up Our Node Class
03:01
Lesson 110. Push
02:11
Lesson 111. Push Solution
04:05
Lesson 112. Pop
03:21
Lesson 113. Pop Solution
06:24
Lesson 114. Shift
02:45
Lesson 115. Shift Solution
04:13
Lesson 116. Unshift
01:37
Lesson 117. Unshift Solution
02:20
Lesson 118. Get
04:03
Lesson 119. Get Solution
07:05
Lesson 120. Set
01:19
Lesson 121. Set Solution
02:09
Lesson 122. Insert
02:51
Lesson 123. Insert Solution
06:49
Lesson 124. Remove
02:19
Lesson 125. Remove Solution
06:29
Lesson 126. Comparing Singly and Doubly Linked Lists
04:33
Lesson 127. Intro to Stacks
06:20
Lesson 128. Creating a Stack with an Array
07:06
Lesson 129. Writing Our Own Stack From Scratch
11:34
Lesson 130. BIG O of Stacks
02:16
Lesson 131. Intro to Queues
04:15
Lesson 132. Creating Queues Using Arrays
03:26
Lesson 133. Writing Our Own Queue From Scratch
10:25
Lesson 134. BIG O of Queues
02:31
Lesson 135. Introduction to Trees
06:47
Lesson 136. Uses For Trees
06:33
Lesson 137. Intro to Binary Trees
05:55
Lesson 138. POP QUIZ!
01:14
Lesson 139. Searching A Binary Search Tree
02:56
Lesson 140. Our Tree Classes
02:46
Lesson 141. BST Insert
03:51
Lesson 142. BST Insert Solution
11:54
Lesson 143. BST Find
04:43
Lesson 144. BST Find Solution
05:37
Lesson 145. Big O of Binary Search Trees
06:00
Lesson 146. Intro To Tree Traversal
04:51
Lesson 147. Breadth First Search Intro
05:53
Lesson 148. Breadth First Search Solution
06:21
Lesson 149. Depth First PreOrder Intro
05:38
Lesson 150. Depth First PreOrder Solution
06:51
Lesson 151. Depth First PostOrder Intro
04:03
Lesson 152. Depth First PostOrder Solution
02:39
Lesson 153. Depth First InOrder Intro
02:08
Lesson 154. Depth First InOrder Solution
02:33
Lesson 155. When to Use BFS and DFS
07:38
Lesson 156. Intro to Heaps
07:31
Lesson 157. Storing Heaps
07:06
Lesson 158. Heap Insert Intro
09:15
Lesson 159. Heap Insert Solution
10:52
Lesson 160. Heap ExtractMax Intro
08:29
Lesson 161. Heap ExtractMax Solution
17:57
Lesson 162. Priority Queue Intro
09:00
Lesson 163. Priority Queue Pseudocode
03:44
Lesson 164. Priority Queue Solution
09:22
Lesson 165. BIG O of Binary Heaps
08:55
Lesson 166. Intro to Hash Tables
05:51
Lesson 167. More About Hash Tables
04:33
Lesson 168. Intro to Hash Functions
06:12
Lesson 169. Writing Our First Hash Function
08:28
Lesson 170. Improving Our Hash Function
07:11
Lesson 171. Handling Collisions
04:01
Lesson 172. Hash Table Set and Get
04:03
Lesson 173. Hash Table Set Solution
05:15
Lesson 174. Hash Table Get Solution
06:44
Lesson 175. Hash Table Keys and Values
01:43
Lesson 176. Hash Table Keys and Values Solution
08:44
Lesson 177. Hash Table Big O Complexity
05:42
Lesson 178. Intro to Graphs
03:51
Lesson 179. Uses for Graphs
07:58
Lesson 180. Types of Graphs
08:50
Lesson 181. Storing Graphs Adjacency Matrix
03:58
Lesson 182. Storing Graphs Adjacency List
02:30
Lesson 183. Adjacency Matrix Vs. List BIG O
05:52
Lesson 184. Add Vertex Intro
02:11
Lesson 185. Add Vertex Solution
02:55
Lesson 186. Add Edge Intro
02:33
Lesson 187. Add Edge Solution
02:12
Lesson 188. Remove Edge Intro
01:37
Lesson 189. Remove Edge Solution
02:43
Lesson 190. Remove Vertex Intro
02:36
Lesson 191. Remove Vertex Solution
04:35
Lesson 192. Intro to Graph Traversal
08:39
Lesson 193. Depth First Graph Traversal
08:31
Lesson 194. DFS Recursive Intro
07:29
Lesson 195. DFS Recursive Solution
12:46
Lesson 196. DFS Iterative Intro
03:39
Lesson 197. DFS Iterative Solution
08:45
Lesson 198. Breadth First Graph Traversal
03:00
Lesson 199. BFS Intro
02:28
Lesson 200. BFS Solution
08:10
顶部