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