Description: Data Structures & Algorithms
Curriculum
- 1 Section
- 36 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- Data Structures & Algorithms36
- 2.1Introduction to Data Structures & Algorithms
- 2.2Stacks
- 2.3Queues & Linked Lists
- 2.4Dictionaries
- 2.5Hashing
- 2.6Trees
- 2.7Tree walks/Traversal
- 2.8Ordered Dictionaries
- 2.9Deletion
- 2.10Quick Sort
- 2.11AVL Trees Part 1
- 2.12AVL Trees Part 2
- 2.13Trees
- 2.14Red Black Trees
- 2.15Insertion in Red Black Trees
- 2.16Disk Based Data Structures
- 2.17Case Study: Searching for Patterns
- 2.18Tries
- 2.19Data Compression
- 2.20Priority Queues
- 2.21Binary Heaps
- 2.22Why Sorting
- 2.23More Sorting
- 2.24Graphs
- 2.25Data Structures for Graphs
- 2.26Two Applications of Breadth First Search
- 2.27Depth First Search
- 2.28Applications of DFS
- 2.29DFS in Directed Graphs
- 2.30Applications of DFS in Directed Graphs
- 2.31Minimum Spanning Trees
- 2.32The Union
- 2.33Prims Algorithm for Minimum Spanning Trees
- 2.34Single Source Shortest Paths
- 2.35Correctness of Dijkstras Algorithm
- 2.36Single Source Shortest Paths
