Find Your Courses

Lecture - 1 Introduction to Data Structures and Algorithms

 Duration 0h 54m

Lecture - 2 Stacks

 Duration 1h 5m

Lecture - 3 Queues and Linked Lists

 Duration 0h 1m

Lecture - 4 Dictionaries

 Duration 0h 54m

Lecture - 5 Hashing

 Duration 1h 1m

Lecture - 6 Trees

 Duration 0h 44m

Lecture - 7 Tree Walks and Traversals

 Duration 0h 52m

Lecture - 8 Ordered Dictionaries

 Duration 0h 57m

Lecture - 9 Deletion

 Duration 0h 59m

Lecture - 10 Quick Sort

 Duration 0h 59m

Lecture - 11 AVL Trees

 Duration 0h 54m

Lecture - 12 AVL Trees

 Duration 1h 1m

Lecture - 13 Trees

 Duration 0h 50m

Lecture - 14 Red Black Trees

 Duration 1h 5m

Lecture - 15 Insertion in Red Black Trees

 Duration 0h 49m

Lecture - 16 Disk Based Data Structures

 Duration 0h 43m

Lecture - 17 Case Study-Searching for Patterns

 Duration 1h 3m

Lecture - 18 Tries

 Duration 1h 2m

Lecture - 19 Data Compression

 Duration 0h 46m

Lecture - 20 Priority Queues

 Duration 0h 50m

Lecture - 21 Binary Heaps

 Duration 0h 42m

Lecture - 22 Why Sorting

 Duration 0h 49m

Lecture - 23 More Sorting

 Duration 0h 58m

Lecture - 24 Graphs

 Duration 0h 57m

Lecture - 25 Data Structures for Graphs

 Duration 0h 58m

Lecture - 26 Two Applications of Breadth First Search

 Duration 0h 54m

Lecture - 27 Depth First Search

 Duration 0h 54m

Lecture - 28 Applications of DFS

 Duration 1h 0m

Lecture - 29 DFS in Directed Graphs

 Duration 0h 54m

Lecture - 30 Applications of DFS in Directed Graphs

 Duration 0h 39m

Lecture - 31 Minimum Spanning Trees

 Duration 0h 59m

Lecture - 32 The Union

 Duration 0h 56m

Lecture - 33 Prims Algorithm for Minimum Spanning Trees

 Duration 1h 2m

Lecture - 34 Single Source Shortest Paths

 Duration 0h 59m

Lecture - 35 Correctness of Dijkstras Algorithm

 Duration 0h 56m