Heaps and Priority Queues: Always Know the Best

# Array representation of heap:
# [50, 30, 20, 15, 10, 8, 16]
#
# Visual tree:
# 50 (0)
# / # 30 (1) 20 (2)
# / / # 15(3)  10(4) 8(5)  16(6)

heap = [50, 30, 20, 15, 10, 8, 16]

def left_child(i): return 2 * i + 1

def right_child(i): return 2 * i + 2

def parent(i): return (i - 1) // 2

# Test
print(left_child(0)) # 1
print(right_child(0))  # 2
print(parent(1)) # 0

def heapify_down(heap, i): """Max heap - move node down""" smallest = i left = 2 * i + 1 right = 2 * i + 2 if left < len(heap) and heap[left] > heap[smallest]: smallest = left if right < len(heap) and heap[right] > heap[smallest]: smallest = right if smallest != i: heap[i], heap[smallest] = heap[smallest], heap[i] heapify_down(heap, smallest)

# Test
heap = [50, 30, 20, 15, 10, 8, 16]
heapify_down(heap, 0)
# If we change root to 5: [5, 30, 20, 15, 10, 8, 16]
# heapify_down moves 5 down to restore heap property

def heapify_up(heap, i): """Max heap - move node up""" while i > 0: parent = (i - 1) // 2 if heap[i] > heap[parent]: heap[i], heap[parent] = heap[parent], heap[i] i = parent else: break

# Test
heap = [50, 30, 20, 15, 10, 8, 16, 60]
# Insert 60 at end, then heapify up
heapify_up(heap, len(heap) - 1)
# 60 bubbles up to be near root

class MaxHeap: def __init__(self): self.heap = [] def insert(self, data): """Insert and maintain heap property - O(log n)""" self.heap.append(data) self.heapify_up(len(self.heap) - 1) def heapify_up(self, i): while i > 0: parent = (i - 1) // 2 if self.heap[i] > self.heap[parent]: self.heap[i], self.heap[parent] = self.heap[parent], self.heap[i] i = parent else: break def extract_max(self): """Remove and return max - O(log n)""" if len(self.heap) == 0: return None max_val = self.heap[0] self.heap[0] = self.heap[-1] self.heap.pop() if len(self.heap) > 0: self.heapify_down(0) return max_val def heapify_down(self, i): while True: largest = i left = 2 * i + 1 right = 2 * i + 2 if left < len(self.heap) and self.heap[left] > self.heap[largest]: largest = left if right < len(self.heap) and self.heap[right] > self.heap[largest]: largest = right if largest != i: self.heap[i], self.heap[largest] = self.heap[largest], self.heap[i] i = largest else: break def peek(self): """Get max without removing - O(1)""" return self.heap[0] if self.heap else None def size(self): return len(self.heap)

# Usage
max_heap = MaxHeap()
for val in [10, 20, 15, 30, 40]: max_heap.insert(val)

print(max_heap.peek()) # 40
print(max_heap.extract_max()) # 40
print(max_heap.peek()) # 30

class MinHeap: def __init__(self): self.heap = [] def insert(self, data): self.heap.append(data) self.heapify_up(len(self.heap) - 1) def heapify_up(self, i): while i > 0: parent = (i - 1) // 2 if self.heap[i] < self.heap[parent]: self.heap[i], self.heap[parent] = self.heap[parent], self.heap[i] i = parent else: break def extract_min(self): if len(self.heap) == 0: return None min_val = self.heap[0] self.heap[0] = self.heap[-1] self.heap.pop() if len(self.heap) > 0: self.heapify_down(0) return min_val def heapify_down(self, i): while True: smallest = i left = 2 * i + 1 right = 2 * i + 2 if left < len(self.heap) and self.heap[left] < self.heap[smallest]: smallest = left if right < len(self.heap) and self.heap[right] < self.heap[smallest]: smallest = right if smallest != i: self.heap[i], self.heap[smallest] = self.heap[smallest], self.heap[i] i = smallest else: break def peek(self): return self.heap[0] if self.heap else None

# Usage
min_heap = MinHeap()
for val in [40, 30, 20, 15, 10]: min_heap.insert(val)

print(min_heap.peek()) # 10
print(min_heap.extract_min()) # 10

def build_heap(arr): """Convert unsorted array to heap in O(n) time""" n = len(arr) # Start from last non-leaf node and heapify down for i in range(n // 2 - 1, -1, -1): heapify_down(arr, i, n) return arr

def heapify_down(arr, i, n): largest = i left = 2 * i + 1 right = 2 * i + 2 if left < n and arr[left] > arr[largest]: largest = left if right < n and arr[right] > arr[largest]: largest = right if largest != i: arr[i], arr[largest] = arr[largest], arr[i] heapify_down(arr, largest, n)

# Test
arr = [3, 7, 1, 9, 2, 8, 4, 5]
heap = build_heap(arr)
print(heap)  # [9, 7, 8, 5, 2, 1, 4, 3] - max heap

def heap_sort(arr): """Sort array using heap sort - O(n log n)""" n = len(arr) # Build max heap for i in range(n // 2 - 1, -1, -1): heapify_down(arr, i, n) # Extract elements one by one for i in range(n - 1, 0, -1): arr[0], arr[i] = arr[i], arr[0] heapify_down(arr, 0, i) return arr

# Test
arr = [3, 7, 1, 9, 2, 8, 4, 5]
print(heap_sort(arr))  # [1, 2, 3, 4, 5, 7, 8, 9]

import heapq

class PriorityQueue: def __init__(self): self.heap = [] def push(self, data, priority): """Lower priority number = higher priority""" heapq.heappush(self.heap, (priority, data)) def pop(self): """Remove and return highest priority item""" if self.heap: return heapq.heappop(self.heap)[1] return None def peek(self): """View highest priority without removing""" return self.heap[0][1] if self.heap else None def size(self): return len(self.heap)

# Hospital triage system
pq = PriorityQueue()
pq.push("Minor cut", 3) # Priority 3 (low)
pq.push("Severe burn", 1) # Priority 1 (critical)
pq.push("Broken arm", 2) # Priority 2 (urgent)

print(pq.pop())  # Severe burn (priority 1)
print(pq.pop())  # Broken arm (priority 2)

Under the Hood: Heaps and Priority Queues: Always Know the Best

Here is what separates someone who merely USES technology from someone who UNDERSTANDS it: knowing what happens behind the screen. When you tap "Send" on a WhatsApp message, do you know what journey that message takes? When you search something on Google, do you know how it finds the answer among billions of web pages in less than a second? When UPI processes a payment, what makes sure the money goes to the right person?

Understanding Heaps and Priority Queues: Always Know the Best gives you the ability to answer these questions. More importantly, it gives you the foundation to BUILD things, not just use things other people built. India's tech industry employs over 5 million people, and companies like Infosys, TCS, Wipro, and thousands of startups are all built on the concepts we are about to explore.

This is not just theory for exams. This is how the real world works. Let us get into it.

Algorithm Complexity and Big-O Notation

Big-O notation describes how an algorithm's performance scales with input size. This is THE most important concept for coding interviews:

  BIG-O COMPARISON (n = 1,000,000 elements): O(1) Constant 1 operation Hash table lookup O(log n) Logarithmic  20 operations Binary search O(n) Linear 1,000,000 ops Linear search O(n log n)  Linearithmic 20,000,000 ops Merge sort, Quick sort O(n²) Quadratic 1,000,000,000,000 Bubble sort, Selection sort O(2ⁿ) Exponential  ∞ (universe dies) Brute force subset Time at 1 billion ops/sec: O(n log n): 0.02 seconds ← Perfectly usable O(n²): 11.5 DAYS ← Completely unusable! O(2ⁿ): Longer than the age of the universe # Python example: Merge Sort (O(n log n)) def merge_sort(arr): if len(arr) <= 1: return arr mid = len(arr) // 2 left = merge_sort(arr[:mid]) # Sort left half right = merge_sort(arr[mid:]) # Sort right half return merge(left, right) # Merge sorted halves def merge(left, right): result = [] i = j = 0 while i < len(left) and j < len(right): if left[i] <= right[j]: result.append(left[i]); i += 1 else: result.append(right[j]); j += 1 result.extend(left[i:]) result.extend(right[j:]) return result

This matters in the real world. India's Aadhaar system must search through 1.4 billion biometric records for every authentication request. At O(n), that would take seconds per request. With the right data structures (hash tables, B-trees), it takes milliseconds. The algorithm choice is the difference between a working system and an unusable one.

Real-World System Design: Swiggy's Architecture

When you order food on Swiggy, here is what happens behind the scenes in about 2 seconds: your location is geocoded (algorithms), nearby restaurants are queried from a spatial index (data structures), menu prices are pulled from a database (SQL), delivery time is estimated using ML models trained on historical data (AI), the order is placed in a distributed message queue (Kafka), a delivery partner is assigned using a matching algorithm (optimization), and real-time tracking begins using WebSocket connections (networking). EVERY concept in your CS curriculum is being used simultaneously to deliver your biryani.

Object-Oriented Programming: Modelling the Real World

OOP lets you model real-world entities as code "objects." Each object has properties (data) and methods (behaviour). Here is a practical example:

class BankAccount: """A simple bank account — like what SBI or HDFC uses internally""" def __init__(self, holder_name, initial_balance=0): self.holder = holder_name self.balance = initial_balance # Private in practice self.transactions = [] # History log def deposit(self, amount): if amount <= 0: raise ValueError("Deposit must be positive") self.balance += amount self.transactions.append(f"+₹{amount}") return self.balance def withdraw(self, amount): if amount > self.balance: raise ValueError("Insufficient funds!") self.balance -= amount self.transactions.append(f"-₹{amount}") return self.balance def statement(self): print(f"
--- Account Statement: {self.holder} ---") for t in self.transactions: print(f"  {t}") print(f"  Balance: ₹{self.balance}")

# Usage
acc = BankAccount("Rahul Sharma", 5000)
acc.deposit(15000) # Salary credited
acc.withdraw(2000) # UPI payment to Swiggy
acc.withdraw(500) # Metro card recharge
acc.statement()

This is encapsulation — bundling data and behaviour together. The user of BankAccount does not need to know HOW deposit works internally; they just call it. Inheritance lets you extend this: a SavingsAccount could inherit from BankAccount and add interest calculation. Polymorphism means different account types can respond to the same .withdraw() method differently (savings accounts might check minimum balance, current accounts might allow overdraft).

Production Engineering: Heaps and Priority Queues: Always Know the Best at Scale

Understanding heaps and priority queues: always know the best at an academic level is necessary but not sufficient. Let us examine how these concepts manifest in production environments where failure has real consequences.

Consider India's UPI system processing 10+ billion transactions monthly. The architecture must guarantee: atomicity (a transfer either completes fully or not at all — no half-transfers), consistency (balances always add up correctly across all banks), isolation (concurrent transactions on the same account do not interfere), and durability (once confirmed, a transaction survives any failure). These are the ACID properties, and violating any one of them in a payment system would cause financial chaos for millions of people.

At scale, you also face the thundering herd problem: what happens when a million users check their exam results at the same time? (CBSE result day, anyone?) Without rate limiting, connection pooling, caching, and graceful degradation, the system crashes. Good engineering means designing for the worst case while optimising for the common case. Companies like NPCI (the organisation behind UPI) invest heavily in load testing — simulating peak traffic to identify bottlenecks before they affect real users.

Monitoring and observability become critical at scale. You need metrics (how many requests per second? what is the 99th percentile latency?), logs (what happened when something went wrong?), and traces (how did a single request flow through 15 different microservices?). Tools like Prometheus, Grafana, ELK Stack, and Jaeger are standard in Indian tech companies. When Hotstar streams IPL to 50 million concurrent users, their engineering team watches these dashboards in real-time, ready to intervene if any metric goes anomalous.

The career implications are clear: engineers who understand both the theory (from chapters like this one) AND the practice (from building real systems) command the highest salaries and most interesting roles. India's top engineering talent earns ₹50-100+ LPA at companies like Google, Microsoft, and Goldman Sachs, or builds their own startups. The foundation starts here.

Key Vocabulary

Here are important terms from this chapter that you should know:

💡 Interview-Style Problem

Here is a problem that frequently appears in technical interviews at companies like Google, Amazon, and Flipkart: "Design a URL shortener like bit.ly. How would you generate unique short codes? How would you handle millions of redirects per second? What database would you use and why? How would you track click analytics?"

Think about: hash functions for generating short codes, read-heavy workload (99% redirects, 1% creates) suggesting caching, database choice (Redis for cache, PostgreSQL for persistence), and horizontal scaling with consistent hashing. Try sketching the system architecture on paper before looking up solutions. The ability to think through system design problems is the single most valuable skill for senior engineering roles.

Where This Takes You

The knowledge you have gained about heaps and priority queues: always know the best is directly applicable to: competitive programming (Codeforces, CodeChef — India has the 2nd largest competitive programming community globally), open-source contribution (India is the 2nd largest contributor on GitHub), placement preparation (these concepts form 60% of technical interview questions), and building real products (every startup needs engineers who understand these fundamentals).

India's tech ecosystem offers incredible opportunities. Freshers at top companies earn ₹15-50 LPA; experienced engineers at FAANG companies in India earn ₹50-1 Cr+. But more importantly, the problems being solved in India — digital payments for 1.4 billion people, healthcare AI for rural areas, agricultural tech for 150 million farmers — are some of the most impactful engineering challenges in the world. The fundamentals you are building will be the tools you use to tackle them.

Crafted for Class 7–9 • Graph Algorithms & Advanced DS • Aligned with NEP 2020 & CBSE Curriculum