DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
A thorough introduction to heaps — what a heap is, the complete binary tree property, min-heap and max-heap definitions, the heap property with visual examples, heap vs BST, array representation with index formulas, real-world applications, and a roadmap through all heap operations.
What Is a Heap?
A heap is a specialized complete binary tree that satisfies the heap property:
- Max-heap: Every parent node is greater than or equal to its children
- Min-heap: Every parent node is less than or equal to its children
The heap property means the maximum (max-heap) or minimum (min-heap) element is always at the root — accessible in O(1).
The Complete Binary Tree Property
A complete binary tree is one where:
- All levels are fully filled except possibly the last level
- The last level is filled from left to right
This property is what allows a heap to be stored in an array without any pointers.
Example
VALID complete binary tree: INVALID (not complete):
A A
/ \ / \
B C B C
/ \ / / \ \
D E F D E G ← gap at F
Array Representation — No Pointers Needed
Because a heap is a complete binary tree, it can be stored in a flat array using this index mapping:
| Parent | (i - 1) // 2 |
| Left child | 2 * i + 1 |
| Right child | 2 * i + 2 |
The max-heap [50, 30, 40, 10, 20, 35, 25, 5, 8] maps to:
Example
Array: [50, 30, 40, 10, 20, 35, 25, 5, 8]
Index: 0 1 2 3 4 5 6 7 8
arr[0]=50 (root)
arr[1]=30, arr[2]=40 (children of 50)
arr[3]=10, arr[4]=20 (children of 30)
arr[5]=35, arr[6]=25 (children of 40)
arr[7]=5, arr[8]=8 (children of 10)
Example
def parent(i): return (i - 1) // 2
def left_child(i): return 2 * i + 1
def right_child(i): return 2 * i + 2
heap = [50, 30, 40, 10, 20, 35, 25, 5, 8]
# Verify max-heap property for index 1 (value=30):
print(heap[parent(1)]) # heap[0] = 50 (parent)
print(heap[left_child(1)]) # heap[3] = 10 (left child)
print(heap[right_child(1)]) # heap[4] = 20 (right child)
# 50 ≥ 30 ≥ 10 and 30 ≥ 20 ✓
Heap vs Binary Search Tree
| Property | Heap | BST (Balanced) |
|---|---|---|
| Access min/max | O(1) — always at root | O(log n) |
| Search arbitrary | O(n) — no ordering | O(log n) |
| Insert | O(log n) | O(log n) |
| Delete min/max | O(log n) | O(log n) |
| Delete arbitrary | O(log n) | O(log n) |
| Build from n items | O(n) | O(n log n) |
| Ordering | Partial (parent > children) | Full (left < root < right) |
| Memory | Array (no pointers) | Pointer-based nodes |
Use Heap when: You only need repeated access to the minimum or maximum. Use BST when: You need ordered traversal, range queries, or search by arbitrary key.
Operations Overview
| Operation | Time | Description |
|---|---|---|
peek() | O(1) | Return min/max without removing |
insert(x) | O(log n) | Add new element |
extract_min/max() | O(log n) | Remove and return min/max |
heapify(arr) | O(n) | Build heap from array |
decrease/increase_key(i, k) | O(log n) | Update a key and restore heap |
delete(i) | O(log n) | Delete element at index i |
merge(h1, h2) | O(n) | Combine two heaps |
Real-World Applications
1. Priority Queue
The most direct application — elements are processed in priority order:
Example
import heapq
pq = []
heapq.heappush(pq, (priority, task)) # min-heap → lowest priority first
next_task = heapq.heappop(pq)[1]
2. Dijkstra's Shortest Path
Example
Always process the unvisited node with smallest current distance.
Min-heap: O((V+E) log V) — much faster than O(V²) with array
3. Heap Sort
Build max-heap in O(n), extract n times in O(n log n) → O(n log n) total.
4. Top-K Problems
python example
import heapq
def k_largest(arr, k):
return heapq.nlargest(k, arr) # O(n log k)
def k_smallest(arr, k):
return heapq.nsmallest(k, arr) # O(n log k)5. Median of a Stream
Use two heaps — max-heap for lower half, min-heap for upper half:
Example
Lower half (max-heap): [1, 2, 3] top = 3
Upper half (min-heap): [4, 5, 6] top = 4
Median = (3 + 4) / 2 = 3.5
6. Operating System Scheduling
CPU schedulers use priority queues (heaps) to select the next process: always run the highest-priority ready process.
Python's heapq Module
Python provides a min-heap through heapq:
Example
import heapq
# Create and use
heap = []
heapq.heappush(heap, 5)
heapq.heappush(heap, 1)
heapq.heappush(heap, 8)
heapq.heappush(heap, 3)
print(heap[0]) # 1 — peek minimum O(1)
print(heapq.heappop(heap)) # 1 — extract minimum O(log n)
print(heapq.heappop(heap)) # 3
# Build heap from list — O(n)
nums = [5, 1, 8, 3, 9, 2]
heapq.heapify(nums) # Converts list to heap in-place
# For max-heap: negate values
max_heap = []
heapq.heappush(max_heap, -5)
heapq.heappush(max_heap, -1)
max_val = -heapq.heappop(max_heap) # 5
# For priority queue of tuples: sort by first element
tasks = [(3, "low"), (1, "high"), (2, "medium")]
heapq.heapify(tasks)
priority, task = heapq.heappop(tasks)
print(task) # "high" (priority 1 = highest)
Summary
A heap is a complete binary tree stored in an array with the heap property (parent ≥ or ≤ children):
- O(1) access to min/max — always at root
- O(log n) insert and extract — sift up/down operations
- O(n) build — heapify algorithm
- Array representation — no pointers, excellent cache performance
- Use for: Priority queues, scheduling, top-K, Dijkstra, median tracking
*Next Lesson: Min Heap*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Heap — Complete Introduction to the Priority-Based Tree Data Structure.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, heaps, heap, introduction
Related Data Structures & Algorithms Topics
Continue learning this concept
HeapsHeap Operations — Complete Reference with Complexity AnalysisComplete reference for all heap operations — push, pop, peek, heapify, decrease/increase key, delete arbitrary, merge heaps, and find Kth element. Each operation explained with algorithm, step-by-step trace, implementation, and formal complexity proof.HeapsHeap Problems — 8 Classic Interview Problems with Complete SolutionsSolve 8 classic heap interview problems — kth largest, top K frequent words, merge K lists, reorganize string, IPO (max capital), find median from data stream, smallest range covering K lists, and minimum cost to connect ropes.HeapsMax Heap — Complete Implementation and ApplicationsMaster the max-heap with complete implementation — insert with sift-up, extract maximum with sift-down, Python workaround using negation, in-place heap sort, max-heap for sliding window maximum, and the kth largest element problem.HeapsMin Heap — Complete Implementation with All OperationsMaster the min-heap data structure with complete from-scratch implementation — insert with sift-up, extract minimum with sift-down, decrease key, delete arbitrary element, build heap in O(n), and heap sort. All operations with detailed traces and complexity analysis.HeapsPriority Queue Using Heap — Implementation, Applications, and PatternsMaster priority queues built on heaps — complete Python and Java implementations, DijkstraArraysArrays — The Complete Introduction to the Most Fundamental Data StructureA thorough introduction to arrays — what they are, how they work in memory, their properties, all basic operations with time and space complexity, comparison with other structures, and when to use them. The foundation of all data structure knowledge.