Min Heap vs Max Heap When to Use Which in DSA Go - Trade-offs & Analysis

Mental Model

A min heap always keeps the smallest item on top, while a max heap keeps the largest item on top. This helps quickly find the smallest or largest value.

Analogy: Think of a min heap like a line where the shortest person is always at the front, and a max heap like a line where the tallest person is always at the front.

Min Heap:
       [1]
      /   \
    [3]   [5]
   /  \
 [7]  [9]

Max Heap:
       [9]
      /   \
    [5]   [3]
   /  \
 [1]  [2]

Dry Run Walkthrough

Input: Min heap with elements: 5, 3, 9, 1, 7; Max heap with elements: 1, 3, 5, 7, 9

Goal: Show how min heap keeps smallest on top and max heap keeps largest on top after inserting elements

Step 1: Insert 5 into empty min heap

Min Heap: [5]
Max Heap: []

Why: Start building min heap with first element

Step 2: Insert 3 into min heap, bubble up to keep smallest on top

Min Heap: [3] -> [5]
Max Heap: []

Why: 3 is smaller than 5, so it moves up to root

Step 3: Insert 9 into min heap, stays as child since larger

Min Heap: [3] -> [5], [9]
Max Heap: []

Why: 9 is larger than 3, no bubble up needed

Step 4: Insert 1 into min heap, bubble up to root

Min Heap: [1] -> [3], [9], [5]
Max Heap: []

Why: 1 is smallest, so it moves to root

Step 5: Insert 7 into min heap, stays as child

Min Heap: [1] -> [3], [9], [5], [7]
Max Heap: []

Why: 7 is larger than 1, no bubble up

Step 6: Insert 1,3,5,7,9 into empty max heap one by one, bubbling up largest to root

Max Heap: [9] -> [7], [5], [1], [3]

Why: 9 is largest, so it moves to root

Result:

Min Heap final: 1 -> 3 -> 9 -> 5 -> 7
Max Heap final: 9 -> 7 -> 5 -> 1 -> 3

Annotated Code

DSA Go

package main

import (
	"container/heap"
	"fmt"
)

// An IntHeap is a min-heap of ints.
type MinHeap []int

func (h MinHeap) Len() int           { return len(h) }
func (h MinHeap) Less(i, j int) bool { return h[i] < h[j] }
func (h MinHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *MinHeap) Push(x interface{}) {
	*h = append(*h, x.(int))
}

func (h *MinHeap) Pop() interface{} {
	n := len(*h)
	x := (*h)[n-1]
	*h = (*h)[:n-1]
	return x
}

// MaxHeap is a max-heap of ints.
type MaxHeap []int

func (h MaxHeap) Len() int           { return len(h) }
func (h MaxHeap) Less(i, j int) bool { return h[i] > h[j] }
func (h MaxHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *MaxHeap) Push(x interface{}) {
	*h = append(*h, x.(int))
}

func (h *MaxHeap) Pop() interface{} {
	n := len(*h)
	x := (*h)[n-1]
	*h = (*h)[:n-1]
	return x
}

func main() {
	minH := &MinHeap{}
	heap.Init(minH)
	for _, v := range []int{5, 3, 9, 1, 7} {
		heap.Push(minH, v) // insert and bubble up
	}
	fmt.Print("Min Heap final: ")
	for _, v := range *minH {
		fmt.Printf("%d -> ", v)
	}
	fmt.Println("null")

	maxH := &MaxHeap{}
	heap.Init(maxH)
	for _, v := range []int{1, 3, 5, 7, 9} {
		heap.Push(maxH, v) // insert and bubble up
	}
	fmt.Print("Max Heap final: ")
	for _, v := range *maxH {
		fmt.Printf("%d -> ", v)
	}
	fmt.Println("null")
}

heap.Push(minH, v) // insert and bubble up

insert element and bubble up to maintain min heap property

heap.Push(maxH, v) // insert and bubble up

insert element and bubble up to maintain max heap property

Output

Min Heap final: 1 -> 3 -> 9 -> 5 -> 7 -> null

Max Heap final: 9 -> 7 -> 5 -> 1 -> 3 -> null

Complexity Analysis

Time: O(n log n) because each insertion takes O(log n) and we insert n elements

Space: O(n) because we store all elements in the heap array

vs Alternative: Using a sorted array would take O(n) per insertion, so heap is faster for dynamic data

Edge Cases

empty heap

heap initializes empty and can accept insertions

DSA Go

heap.Init(minH)

single element

heap has one element which is both min and max

DSA Go

heap.Push(minH, v)

all elements equal

heap keeps all elements but order does not matter as all are same

DSA Go

heap.Push(minH, v)

When to Use This Pattern

When you need quick access to smallest or largest element repeatedly, use min heap or max heap respectively because they keep that element at the top efficiently.

Common Mistakes

Mistake: Using min heap when you need largest element quickly
Fix: Use max heap instead to keep largest element on top

Mistake: Not bubbling up after insertion
Fix: Always bubble up to restore heap property after insert

Summary

Min heap keeps smallest element on top; max heap keeps largest element on top.

Use min heap when you want quick access to smallest item, max heap for largest item.

The key is that heap structure keeps the top element as min or max by bubbling up on insert.

Practice

1. What is the main difference between a Min Heap and a Max Heap?

easy

A. Min Heap always has the smallest element at the root, Max Heap has the largest at the root

B. Min Heap stores only positive numbers, Max Heap stores only negative numbers

C. Min Heap is a sorted array, Max Heap is a linked list

D. Min Heap and Max Heap are the same data structure

Solution

1. Step 1: Understand heap root property

   Min Heap keeps the smallest element at the root node, so it can be accessed quickly. Max Heap keeps the largest element at the root.

2. Step 2: Compare Min Heap and Max Heap behavior

   This difference defines their use cases: Min Heap for quick access to minimum, Max Heap for maximum.

3. Final Answer:

   Min Heap always has the smallest element at the root, Max Heap has the largest at the root -> Option A

4. Quick Check:

   Root element defines heap type = A [OK]

Hint: Root element smallest? Min Heap; largest? Max Heap [OK]

Common Mistakes:

• Confusing Min Heap with sorted array
• Thinking heaps store only positive or negative numbers
• Believing Min Heap and Max Heap are identical

2. Which of the following is the correct way to declare a Min Heap in Go using container/heap package?

easy

A. var h = make([]int, 0) // slice without heap.Interface

B. var h = &IntHeap{} // IntHeap implements heap.Interface with Less for min heap

C. var h = &IntHeap{} // IntHeap implements heap.Interface with Less for max heap

D. var h = new(MaxHeap) // MaxHeap is built-in type

Solution

1. Step 1: Understand Go heap.Interface usage

   In Go, to create a Min Heap, you implement heap.Interface with Less method returning true if element i is less than j.

2. Step 2: Identify correct declaration

   var h = &IntHeap{} // IntHeap implements heap.Interface with Less for min heap shows a pointer to IntHeap which implements heap.Interface correctly for Min Heap. Others are incorrect or incomplete.

3. Final Answer:

   var h = &IntHeap{} // IntHeap implements heap.Interface with Less for min heap -> Option B

4. Quick Check:

   heap.Interface with Less for min heap = C [OK]

Hint: Min Heap needs Less(i,j) true if i

Common Mistakes:

• Using slice without implementing heap.Interface
• Confusing Less method for max heap
• Assuming MaxHeap is built-in type

3. What will be the output of the following Go code snippet that uses a Max Heap?

package main

import (
  "container/heap"
  "fmt"
)

type IntHeap []int

func (h IntHeap) Len() int           { return len(h) }
func (h IntHeap) Less(i, j int) bool { return h[i] > h[j] } // Max Heap
func (h IntHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *IntHeap) Push(x interface{}) {
  *h = append(*h, x.(int))
}

func (h *IntHeap) Pop() interface{} {
  old := *h
  n := len(old)
  x := old[n-1]
  *h = old[0 : n-1]
  return x
}

func main() {
  h := &IntHeap{2, 5, 1}
  heap.Init(h)
  heap.Push(h, 10)
  fmt.Println(heap.Pop(h))
}

medium

A. 10

B. 5

C. 2

D. 1

Solution

1. Step 1: Understand Max Heap property in Less method

   The Less method returns true if h[i] > h[j], so the largest element is at the root.

2. Step 2: Trace heap operations

   Initial heap: [2,5,1]. After heap.Init, heap property is established. Push 10 adds 10. Pop removes and returns the largest element, which is 10.

3. Final Answer:

   10 -> Option A

4. Quick Check:

   Max Heap root is largest = 10 [OK]

Hint: Max Heap pops largest element first [OK]

Common Mistakes:

• Confusing Min Heap and Max Heap Less method
• Assuming Pop returns smallest element
• Not initializing heap before Push

4. The following Go code tries to implement a Min Heap but does not work correctly. What is the bug?

type IntHeap []int

func (h IntHeap) Len() int           { return len(h) }
func (h IntHeap) Less(i, j int) bool { return h[i] > h[j] } // Intended Min Heap
func (h IntHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *IntHeap) Push(x interface{}) {
  *h = append(*h, x.(int))
}

func (h *IntHeap) Pop() interface{} {
  old := *h
  n := len(old)
  x := old[n-1]
  *h = old[0 : n-1]
  return x
}

medium

A. Swap method swaps elements incorrectly

B. Push method does not append correctly

C. Less method uses '>' instead of '<', so it creates a Max Heap

D. Pop method returns wrong element

Solution

1. Step 1: Analyze Less method for heap type

   The Less method returns true if h[i] > h[j], which means it treats larger elements as higher priority, creating a Max Heap, not Min Heap.

2. Step 2: Confirm other methods are correct

   Push appends correctly, Pop returns last element, Swap swaps correctly. The bug is only in Less method.

3. Final Answer:

   Less method uses '>' instead of '<', so it creates a Max Heap -> Option C

4. Quick Check:

   Less defines heap type; '>' means Max Heap [OK]

Hint: Less method '<' for Min Heap, '>' for Max Heap [OK]

Common Mistakes:

• Mixing up Less method logic
• Blaming Push or Pop methods incorrectly
• Ignoring heap.Interface contract

5. You want to efficiently track the top 3 highest scores from a stream of player scores in Go. Which heap type should you use and why?

hard

A. Use a Max Heap of unlimited size to store all scores

B. Use a Max Heap of size 3 to keep the top scores by removing larger ones

C. Use a Min Heap of unlimited size to store all scores

D. Use a Min Heap of size 3 to keep the top scores by removing smaller ones

Solution

1. Step 1: Understand the problem of tracking top 3 highest scores

   We want to keep only the top 3 highest scores efficiently as new scores arrive.

2. Step 2: Choose heap type and size

   A Min Heap of size 3 keeps the smallest of the top scores at the root. When a new score is higher than the root, replace root and heapify. This keeps top 3 highest scores efficiently.

3. Final Answer:

   Use a Min Heap of size 3 to keep the top scores by removing smaller ones -> Option D

4. Quick Check:

   Min Heap size 3 tracks top scores by removing smaller [OK]

Hint: Min Heap size k tracks top k largest by removing smaller [OK]

Common Mistakes:

• Using Max Heap and removing larger scores incorrectly
• Using unlimited size heaps wasting memory
• Not limiting heap size to k