Home

Awesome

Data Structures & Algorithms

Code examples from my YouTube channel. The code may differ on some videos, as I've added to this retroactively.

Topics

TopicDescriptionPlaylistCode
CS TutorialsAll of my computer science tutorials in one playlist.PlaylistCode
Analyzing AlgorithmsTime complexity of algorithms including 𝚯, O, and 𝛀.PlaylistCode
Data StructuresThe building blocks!PlaylistCode
Minimum Spanning TreesGreedy algorithms for finding a minimum spanning tree in a weighted, undirected graph. Prim's = pick a node. Kruskal's = iterate through edges.PlaylistCode
Shortest Path AlgosDijkstra's = shortest path from one node to all nodes. Bellman–Ford = shortest path from one node to all nodes, negative edges allowed (not negative cycles). Floyd–Warshall = shortest path between all pairs of vertices, negative edges allowed (not negative cycles).PlaylistCode
Maximum Flow AlgosAlgorithms that compute the maximum flow in a flow network. Ford–Fulkerson = greedy.PlaylistCode
Search AlgosSearching arrays and tree data structures.PlaylistCode
Sort AlgosSorting unordered arrays.PlaylistCode
Tree Traversal AlgosTraversing binary search trees.PlaylistCode
Red-Black TreesSelf-balancing binary search trees with red and black nodes.PlaylistCode
AVL TreesSelf-balancing binary search trees with nodes that have a balance factor of -1, 0, or 1. Balance factor = height of left child - height of right child.PlaylistCode
B-TreesSelf-balancing search trees with nodes that may have more than two children. Well suited for databases and file systems.PlaylistCode
HeapsNearly complete binary trees useful for priority queues (min–heaps) and heap sort (max–heaps).PlaylistCode
Fibonacci HeapsData structure that implements a mergeable heap.PlaylistCode

Additional Learning

Languages

Subtitles are posted in the languages below. If I missed yours, send me a note.