Heap

Summary

A tree-based structure that keeps the minimum (or maximum) element quickly accessible — the engine behind priority queues, used for 'top K' and scheduling problems.

How to Learn This

1Solve a 'find the K largest/smallest elements' problem using a heap.
2Learn the difference between a min-heap and a max-heap.
3Recognize heap-shaped problems: anything about 'top K', 'kth largest', or merging sorted data.

HashMap

Tree

More topics in Data Structures & Algorithms

Arrays Strings Linked List Stack Queue HashMap Tree Graph Binary Search Recursion Backtracking Sliding Window Greedy Dynamic Programming Sorting Searching

Stuck on this topic? Ask an Insider

Get 1:1 guidance from people who've walked this exact path — free on the InsideEdge app.

Download