How do I implement a heap in Java?

How do I implement a heap in Java?

To implement a heap in Java, you can use an array to represent the heap structure. Would you like to see a code example?

Yes, please provide a code example.

Here's a simple implementation of a min-heap in Java:

class MinHeap {
    private int[] heap;
    private int size;
    private int capacity;

    public MinHeap(int capacity) {
        this.capacity = capacity;
        this.size = 0;
        heap = new int[capacity];
    }

    private int parent(int index) { return (index - 1) / 2; }
    private int leftChild(int index) { return 2 * index + 1; }
    private int rightChild(int index) { return 2 * index + 2; }

    private void swap(int index1, int index2) {
        int temp = heap[index1];
        heap[index1] = heap[index2];
        heap[index2] = temp;
    }

    public void insert(int element) {
        if (size == capacity) {
            throw new RuntimeException("Heap is full");
        }
        heap[size] = element;
        size++;
        heapifyUp(size - 1);
    }

    private void heapifyUp(int index) {
        while (index > 0 && heap[parent(index)] > heap[index]) {
            swap(parent(index), index);
            index = parent(index);
        }
    }
}

Would you like to know more about heap operations?

What are the main operations I can perform on a heap?

The main operations on a heap include insertion, deletion (removing the root), and heapify (restructuring the heap). Would you like details on any specific operation?