ViewTube

Learn Data Structures and Algorithms in Python in ONE video, updated for 2027. 45 lessons where every idea is animated before ...

Data structures seem simple. An array stores data, a stack stores data, and a tree stores data. But if they all store information, why ...

What does it mean for an algorithm to run in O(log n), O(n), or O(n²) time, and why does it matter? Professor Yun William Yu ...

A hash map lets you look up a value by its key in constant time, on average. But what actually happens inside when you call put, ...

Kruskal's algorithm builds a minimum spanning tree by sorting every edge and keeping each one that does not close a cycle.

An LRU cache forgets what was used longest ago, but some entries are popular and should stay even if they were not touched ...

DSA with Python, lecture 38 of 45: data structures and algorithms explained so simply that anyone can follow, with animations, live ...

A* search finds shortest paths faster than Dijkstra's algorithm by using an estimate of the remaining distance to aim toward the ...

Linked lists explained from zero with one freight train: every wagon holds only the hook of the next. Adding 200000 items at the ...

A hash set remembers keys and answers one question very quickly: is this key in here? But what really happens inside when you ...

DSA with Python, lecture 43 of 45: data structures and algorithms explained so simply that anyone can follow, with animations, live ...

It is useful for beginners learning sorting algorithms, binary heaps, binary trees, and Data Structures and Algorithms (DSA).

How do you order tasks that depend on each other? Professor Yun William Yu (Carnegie Mellon University) explains topological ...

Lecture 6 of the Data Structures and Algorithms in C course! Linked lists, trees and graphs are all built from pointers, so before we ...

DSA with Python, lecture 45 of 45: data structures and algorithms explained so simply that anyone can follow, with animations, live ...

Lecture 5 of the Data Structures and Algorithms in C course! The same code can take 1 step on one input and n steps on another ...

When can you split a graph's nodes into two groups so that every edge crosses between them? Professor Yun William Yu ...