| "Data Structures And Algorithms" - Video Lectures | |||
| 1. Introduction to Data Structures and Algorithms | |||
| 2. Stacks | |||
| 3. Queues and Linked Lists | |||
| 4. Dictionaries | |||
| 5. Hashing | |||
| 6. Trees | |||
| 7. Tree Walks / Traversals | |||
| 8. Ordered Dictionaries | |||
| 9. Deletion | |||
| 10. Quick Sort | |||
| 11. AVL Trees | |||
| 12. AVL Trees | |||
| 13. Trees | |||
| 14. Red Black Trees | |||
| 15. Insertion in Red Black Trees | |||
| 16. Disk Based Data Structures | |||
| 17. Case Study: Searching for Patterns | |||
| 18. Tries | |||
| 19. Data Compression | |||
| 20. Priority Queues | |||
| 21. Binary Heaps | |||
| 22. Why Sorting | |||
| 23. More Sorting | |||
| 24. Graphs | |||
| 25. Data Structures for Graphs | |||
| 26. Two Applications of Breadth First Search | |||
| 27. Depth First Search | |||
| 28. Applications of DFS | |||
| 29. DFS in Directed Graphs | |||
| 30. Applications of DFS in Directed Graphs | |||
| 31. Minimum Spanning Trees | |||
| 32. The Union | |||
| 33. Prims Algorithm for Minimum Spanning Trees | |||
| 34. Single Source Shortest Paths | |||
| 35. Correctness of Dijkstras Algorithm | |||
| 36. Single Source Shortest Paths | |||