Binary Search Trees and Algorithms on Trees-Course Overview
Earn Academic Credit for your Work!
Course Support
Important Prerequisites
Logistics: Textbook and Readings
Important Specialization Information
Binary Search Trees and Algorithms on Trees-Overview of Module 1
Overview of Module 1
Binary Search Trees and Algorithms on Trees-Binary Search Trees -- Introduction and Properties
Binary Search Trees -- Introduction and Properties
()
Reading CLRS Chapter 12
Binary Search Trees and Algorithms on Trees-Binary Search Trees -- Insertion and Deletion
Binary Search Trees -- Insertion and Deletion
()
CLRS Chapter 12.1-12.3
Binary Search Trees and Algorithms on Trees-Red-Black Tree Basics
Red-Black Trees Basics
()
CLRS Chapter 13 - 13.1
Binary Search Trees and Algorithms on Trees-Red-Black Trees -- Rotations/Algorithms for Insertion (and Deletion)
Red-Black Trees -- Rotations/Algorithms for Insertion (and Deletion)
()
CLRS Chapter 13.2 - 13.3
Binary Search Trees and Algorithms on Trees-Skip Lists
Skip Lists
()
Skip
Basics of Graphs and Graphs Traversals-Overview of Module 2
Overview of Module 2
Basics of Graphs and Graphs Traversals-Graphs and their Representations
Graphs and Their Representations
()
CLRS Chapter 22 (Section 22.1)
Basics of Graphs and Graphs Traversals-Graph Traversals and Breadth First Traversal
Graph Traversals and Breadth First Traversal
()
CLRS Chapter 22 (Section 22.2)
Basics of Graphs and Graphs Traversals-Depth First Search
Depth First Search
()
CLRS Chapter 22 (Section 22.3)
Basics of Graphs and Graphs Traversals-Topological Sorting and Applications
Topological Sorting and Applications
()
CLRS Chapter 22 (Section 22.4
Basics of Graphs and Graphs Traversals-Finding Strongly Connected Components
Strongly Connected Components - Definitions
()
Strongly Connected Components - Properties
()
Strongly Connected Components - Algorithm
()
CLRS Chapter 22 (Section 22.5)
Union-Find Data Structures and Spanning Tree Algorithms-Overview of Module 3
Overview of Module 3
Union-Find Data Structures and Spanning Tree Algorithms-Amortized Analysis
Amortized Analysis of Data Structures
()
Amortized Analysis: Potential Functions
()
CLRS Chapter 17
Union-Find Data Structures and Spanning Tree Algorithms-Spanning Trees and Minimal Spanning Trees with Applications
Spanning Trees and Minimal Spanning Trees with Applications
()
CLRS Chapter 23 (Section 23.1)
Union-Find Data Structures and Spanning Tree Algorithms-Kruskal’s Algorithm for Finding Minimal Spanning Trees
Kruskal’s Algorithm for Finding Minimal Spanning Trees
()
CLRS Chapter 23 (Section 23.2)
Union-Find Data Structures and Spanning Tree Algorithms-Union-Find Data Structures and Rank Compression
Union-Find Data Structures and Rank Compression
()
CLRS Chapter 21
Shortest Path Algorithms-Overview of Module 4
Overview of Module 4
Shortest Path Algorithms-Shortest Path Problems and Their Properties
Shortest Path Problems and Their Properties
()
CLRS Chapter 24 (up to section 24.1)
Shortest Path Algorithms-Bellman-Ford Algorithm for Single Source Shortest Paths
Bellman-Ford Algorithm for Single Source Shortest Paths
()
CLRS Chapter 24 (Section 24.1)
Shortest Path Algorithms-Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights
Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights
()
Proof of Dijkstra's Algorithm
()
CLRS Chapter 24 (Section 24.3 and 24.5)
Shortest Path Algorithms-Shortest Path on DAGs
Shortest Path on DAGs
()
CLRS Chapter 24 (Section 24.2)
Shortest Path Algorithms-All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm
All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm
()
CLRS Chapter 25 (Sections 25.1 and 25.2)