Heap Concept Structure and Properties in DSA Java - Build from Scratch

Heap Concept Structure and Properties

📖 Scenario: Imagine you are organizing a priority queue for tasks where the highest priority task should always be easy to find. A heap is a special tree structure that helps with this by keeping the highest priority item at the top.

🎯 Goal: You will create a simple array-based heap structure in Java, understand how to store elements, and print the heap array to see its structure.

📋 What You'll Learn

Create an integer array called heap with the exact values {20, 15, 10, 8, 12, 9, 5}

Create an integer variable called heapSize and set it to the length of the heap array

Write a method called printHeap that prints the elements of the heap array separated by spaces

Call the printHeap method to display the heap elements

💡 Why This Matters

🌍 Real World

Heaps are used in priority queues, scheduling tasks, and algorithms like heap sort.

💼 Career

Understanding heaps is important for software engineers working with efficient data processing and algorithm optimization.

1

Create the Heap Array

Create an integer array called heap with these exact values: {20, 15, 10, 8, 12, 9, 5}.

DSA Java

// Your code here

Hint

Use int[] heap = {20, 15, 10, 8, 12, 9, 5}; to create the array.

2

Add Heap Size Variable

Create an integer variable called heapSize and set it to the length of the heap array.

DSA Java

public class HeapExample {
    public static void main(String[] args) {
        int[] heap = {20, 15, 10, 8, 12, 9, 5};
        // Your code here
    }
}

Hint

Use int heapSize = heap.length; to get the size of the heap.

3

Write Method to Print Heap

Write a method called printHeap that takes the heap array and heapSize as parameters and prints the elements separated by spaces using a for loop.

DSA Java

public class HeapExample {
    public static void main(String[] args) {
        int[] heap = {20, 15, 10, 8, 12, 9, 5};
        int heapSize = heap.length;
        // Your code here
    }
}

Hint

Define printHeap with parameters int[] heap and int heapSize. Use a for loop to print each element followed by a space.

4

Print the Heap Elements

Call the printHeap method inside main to display the heap elements.

DSA Java

public class HeapExample {
    public static void main(String[] args) {
        int[] heap = {20, 15, 10, 8, 12, 9, 5};
        int heapSize = heap.length;
        // Your code here
    }

    public static void printHeap(int[] heap, int heapSize) {
        for (int i = 0; i < heapSize; i++) {
            System.out.print(heap[i] + " ");
        }
    }
}

Hint

Make sure to call printHeap(heap, heapSize); inside main.

Practice

1. What is a key property of a max-heap data structure?

easy

A. The tree is always a complete binary tree but not necessarily balanced

B. The value of each parent node is less than or equal to its children

C. All leaf nodes have the same value

D. The value of each parent node is greater than or equal to its children

Solution

1. Step 1: Understand max-heap property

   A max-heap requires that every parent node's value is greater than or equal to its children.

2. Step 2: Compare options with max-heap definition

   The value of each parent node is greater than or equal to its children matches the max-heap property exactly, while others describe min-heap or unrelated properties.

3. Final Answer:

   The value of each parent node is greater than or equal to its children -> Option D

4. Quick Check:

   Max-heap parent ≥ children = A [OK]

Hint: Max-heap means parent node ≥ children nodes [OK]

Common Mistakes:

• Confusing max-heap with min-heap property
• Thinking leaf nodes must have same value
• Ignoring the complete binary tree requirement

2. Which of the following is the correct way to declare a min-heap using Java's PriorityQueue?

easy

A. PriorityQueue<Integer> minHeap = new PriorityQueue<>(Collections.reverseOrder());

B. PriorityQueue<Integer> minHeap = new PriorityQueue<>(Comparator.reverseOrder());

C. PriorityQueue<Integer> minHeap = new PriorityQueue<>();

D. PriorityQueue<Integer> minHeap = new PriorityQueue<>(Collections.naturalOrder());

Solution

1. Step 1: Recall Java PriorityQueue default behavior

   By default, PriorityQueue in Java is a min-heap, so no comparator is needed.

2. Step 2: Analyze options for min-heap declaration

   PriorityQueue<Integer> minHeap = new PriorityQueue<>(); uses default constructor, which creates a min-heap. A and B use reverseOrder creating max-heap, C uses non-existent Collections.naturalOrder().

3. Final Answer:

   PriorityQueue<Integer> minHeap = new PriorityQueue<>(); -> Option C

4. Quick Check:

   Default PriorityQueue = min-heap = D [OK]

Hint: Default PriorityQueue in Java is min-heap [OK]

Common Mistakes:

• Using reverseOrder() creates max-heap, not min-heap
• Confusing naturalOrder() with reverseOrder()
• Adding unnecessary comparator for default min-heap

3. What will be the output of the following Java code snippet?

import java.util.PriorityQueue;
public class TestHeap {
  public static void main(String[] args) {
    PriorityQueue<Integer> heap = new PriorityQueue<>();
    heap.add(30);
    heap.add(10);
    heap.add(20);
    System.out.print(heap.poll() + ", " + heap.poll() + ", " + heap.poll());
  }
}

medium

A. 20, 10, 30

B. 10, 20, 30

C. 30, 20, 10

D. 10, 30, 20

Solution

1. Step 1: Understand PriorityQueue behavior

   Java's PriorityQueue is a min-heap by default, so poll() returns the smallest element.

2. Step 2: Trace poll() calls

   Elements added: 30, 10, 20. First poll() returns 10, second 20, third 30.

3. Final Answer:

   10, 20, 30 -> Option B

4. Quick Check:

   poll() returns min element each time = 10,20,30 [OK]

Hint: poll() returns smallest element in min-heap [OK]

Common Mistakes:

• Assuming poll() returns elements in insertion order
• Confusing min-heap with max-heap behavior
• Not realizing poll() removes elements

4. Identify the error in the following code that attempts to create a max-heap using Java's PriorityQueue:

import java.util.PriorityQueue;
import java.util.Collections;
public class MaxHeapExample {
  public static void main(String[] args) {
    PriorityQueue<Integer> maxHeap = new PriorityQueue<>();
    maxHeap.add(5);
    maxHeap.add(15);
    maxHeap.add(10);
    System.out.println(maxHeap.poll());
  }
}

medium

A. PriorityQueue is not initialized with a comparator for max-heap

B. PriorityQueue cannot store Integer objects

C. poll() method does not exist for PriorityQueue

D. add() method cannot be used to insert elements

Solution

1. Step 1: Check PriorityQueue initialization

   The code initializes PriorityQueue without a comparator, so it defaults to min-heap.

2. Step 2: Identify max-heap creation mistake

   To create max-heap, PriorityQueue must be initialized with Collections.reverseOrder() comparator.

3. Final Answer:

   PriorityQueue is not initialized with a comparator for max-heap -> Option A

4. Quick Check:

   Missing comparator = B [OK]

Hint: Max-heap needs reverseOrder() comparator in PriorityQueue [OK]

Common Mistakes:

• Assuming default PriorityQueue is max-heap
• Thinking poll() method is invalid
• Believing add() cannot insert elements

5. Given a max-heap represented as an array: [50, 30, 40, 10, 20], which of the following arrays represents the heap after inserting the element 35 and re-heapifying?

hard

A. [50, 30, 40, 10, 20, 35]

B. [50, 35, 40, 10, 20, 30]

C. [50, 40, 30, 10, 20, 35]

D. [50, 40, 35, 10, 20, 30]

Solution

1. Step 1: Insert 35 at the end of the array

   Array becomes [50, 30, 40, 10, 20, 35].

2. Step 2: Re-heapify by comparing 35 with its parent

   Parent of index 5 is index 2 (40). Since 35 <= 40, no swap needed. Heap property is maintained.

3. Step 3: Check if bubbling up is needed

   Since 35 < 40, no bubble up occurs, so the array remains [50, 30, 40, 10, 20, 35]. However, this matches [50, 30, 40, 10, 20, 35], but [50, 30, 40, 10, 20, 35] is not the correct max-heap after insertion because 35 should bubble up if possible.

4. Step 4: Correct bubbling up

   Actually, 35 is less than 40, so no swap with parent. The heap remains [50, 30, 40, 10, 20, 35].

5. Final Answer:

   [50, 30, 40, 10, 20, 35] -> Option A

6. Quick Check:

   Insert 35 at end, parent(5)=40 >= 35, no bubble up = D [OK]

Hint: Insert at end, then bubble up to fix max-heap [OK]

Common Mistakes:

• Not bubbling up after insertion
• Swapping with wrong parent index
• Assuming insertion at root