Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Byte-Sized-Chunks: Stacks, Queues, Binary Trees, Heaps
Strong Fundamentals: Data Structures!
You, This Course, and Us! (1:09)
Meet The Stack - Simple But Powerful (15:40)
Building A Stack Using Java (16:53)
Match Parenthesis To Check A Well Formed Expression (11:21)
Find The Minimum Element In A Stack In Constant Time (8:51)
Meet The Queue - A Familiar Sight In Everyday Life (14:11)
The Circular Queue - Tricky But Fast (19:44)
Build A Queue With Two Stacks (17:30)
Binary Trees
Meet The Binary Tree - A Hierarchical Data Structure (13:03)
Breadth First Traversal (18:43)
Depth First - Pre-OrderTraversal (14:35)
Depth First - In-Order and Post-Order Traversal (13:51)
Binary Search Trees
The Binary Search Tree - an introduction (9:49)
Insertion and Lookup in a Binary Search Tree (17:00)
Binary Tree Problems
Minimum Value, Maximum Depth and Mirror (11:46)
Count Trees, Print Range and Is BST (14:39)
Has Path Sum, Print Paths, Least Common Ancestor (14:49)
Heaps
The Heap Is Just The Best Way to Implement a Priority Queue (17:15)
Meet The Binary Heap - It's A Tree At Heart (12:39)
The Binary Heap - Making It Real With Code (7:38)
The Binary Heap - Logically A Tree Really An Array (17:14)
Heapify! (19:33)
Insert And Remove From A Heap (16:34)
Has Path Sum, Print Paths, Least Common Ancestor
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock