Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Data Structures and Algorithms
·
Module 8
Heaps and Priority Queues
1
Heap Operations: Sift-Up and Sift-Down
Explain heap properties and implement core heap operations (sift-up, sift-down).
2
Heap-based Priority Queues
Implement a priority queue using a heap.
3
Solving Top K Problems with Heaps
Solve 'Top K' element problems using a min-heap or max-heap with O(n log k) complexity.
4
Merging K Sorted Lists
Merge K sorted lists efficiently using a min-heap.
5
Finding the Median from a Data Stream
Design a data structure to find the median from a data stream using two heaps.
Previous module
Binary Search Trees
Next module
Recursion and Backtracking