31251 Lecture 1.8: C-style Arrays

(14:20)

31251 Lecture 12.1: Minimum spanning trees and Prim's algorithm

(28:47)

31251 Lecture 12.2: Kruskal's algorithm

(21:27)

31251 Lecture 7.1: Graph intro and terminology

(13:8)

31251 Lecture 7.2: Priority queue---motivation and implementation with binary heap

(26:49)

31251 Lecture 9.3: Depth-first search

(18:1econd)

31251 Lecture 7.3: Implementation of a binary heap

(18:4)

31251 Lecture 8.2: Binary Search Trees

(29:3)

31251 Lecture 8.3: In-order Traversal

(11:35)

31251 Lecture 9.2: Graph data structures

(17:5)

31251 Lecture 8.6: AVL insert

(16:20)

31251 Lecture 8.1: Motivating the use of Binary Search Trees

(9:41)

31251 Lecture 13.2: Counting paths with dynamic programming

(9:46)

31251 Lecture 8.4: Height of a Binary Search Tree

(6:13)

31251 Lec 6.2: Valid Parentheses (motivation for a stack)

(16:19)

31251 Lec 2.1: Abstract Data Types

(6:48)

31251 Lec 2.2: Fixed-Size Arrays

(6:20)

31251 Lec 5.5: Mergesort example

(7:46)

31251 Lecture 8.5: Introduction to AVL trees

(14:42)