Scribd
Upload
4 views6 pages

Program Binaryheap

The document contains a Java implementation of a Min Binary Heap data structure, including methods for insertion, deletion, and checking if the heap is empty or full. It defines a BinaryHeap class with functionalities such as percolating elements up and down to maintain the heap property. The main class demonstrates the creation of a binary heap, insertion of elements, and deletion of the minimum element, along with printing the heap's contents.

Uploaded by

HALO ACA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views6 pages

Program Binaryheap

The document contains a Java implementation of a Min Binary Heap data structure, including methods for insertion, deletion, and checking if the heap is empty or full. It defines a BinaryHeap class with functionalities such as percolating elements up and down to maintain the heap property. The main class demonstrates the creation of a binary heap, insertion of elements, and deletion of the minimum element, along with printing the heap's contents.

Uploaded by

HALO ACA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

package binaryHeap;

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

class BinaryHeap

private int heapSize;

private int[] heap;

/** Constructor **/

public BinaryHeap(int maxSizeArray)

heapSize = 0;

heap = new int[maxSizeArray + 1];

//Arrays.fill(heap, -1);

/** Method untuk mengecek apakah Pohon Heap Kosong**/

public boolean isEmpty( )

return heapSize == 0;

/** Method untuk mengecek apakah pohon heap penuh **/

public boolean isFull( )

return heapSize == heap.length;

/** Method untuk mengosongkan Pohon Heap **/

public void makeEmpty( )

{
heapSize = 0;

/** Method untuk get index parent **/

private int index_parent(int i)

return (i - 1)/2;

/** Method untuk get index child **/

private int index_child(int i, int k)

return 2 * i + k;

/** Method Percolate Up **/

private void percolateUp_minHeap(int childInd) {

int tmp = heap[childInd]; // Menampung elemen child

while (childInd > 0 && tmp < heap[index_parent(childInd)]) { // Indeks child > 0 dan
elemen child < elemen parent

heap[childInd] = heap[index_parent(childInd)]; // Elemen child diisi dengan elemen


parent

childInd = index_parent(childInd); // Indeks child diisi dengan indeks parent

heap[childInd] = tmp; // Elemen parent diisi dengan tmp

/** Method untuk insert element **/

public void insert_minHeap(int x) {

if (isFull()) { // Cek apakah pohon penuh

System.out.println("Full !!!");

/** Percolate up **/

heap[heapSize] = x; // Indeks x adalah sebelum ++

percolateUp_minHeap(heapSize++); // heapSize telah mengalami ++


}

/** Method untuk get smallest child **/

private int minimumChild(int index)

int minChild = index_child(index, 1);

int k = 2;

int child_2 = index_child(index, k);

while ((k <= 2) && (child_2 < heapSize))

if (heap[child_2] < heap[minChild])

minChild = child_2;

k++;

//child_2 = index_child(index, k++);

return minChild;

/** Method Percolate Down **/

private void percolateDown(int index_parent)

int child;

int tmp = heap[ index_parent ]; //menampung elemen parent

while (index_child(index_parent, 1) < heapSize)

child = minimumChild(index_parent);

if (heap[child] < tmp)

heap[index_parent] = heap[child];
}

else

break;

index_parent = child;

heap[index_parent] = tmp;

/** Method untuk delete min element **/

public int deleteMin()

int ind = 0;

if (isEmpty())

System.out.println("Empty !!!");

int keyItem = heap[ind];

heap[ind] = heap[heapSize - 1];

heapSize--;

/** Percolate Down **/

percolateDown(ind);

return keyItem;

/** Method untuk mencetak element heap **/

public void printHeap()

System.out.print("\nMin Binary Heap = ");

for (int i = 0; i < heapSize; i++)


{

System.out.print(heap[i] +" ");

System.out.println();

public class BinaryHeap_MuhammadNirraca {

public static void main(String[] args) throws NumberFormatException, IOException {

// TODO Auto-generated method stub

BufferedReader br = new BufferedReader (new InputStreamReader (System.in));

System.out.println("--------------------Min Binary Heap--------------------\n");

System.out.print("Masukkan Ukuran Array : ");

int n = Integer.parseInt(br.readLine());

BinaryHeap minheap = new

BinaryHeap(n);

minheap.insert_minHeap(42);

minheap.insert_minHeap(40);

minheap.insert_minHeap(58);

minheap.insert_minHeap(65);

minheap.insert_minHeap(2);

minheap.insert_minHeap(3);

minheap.insert_minHeap(3);

minheap.insert_minHeap(43);

minheap.insert_minHeap(1);

minheap.insert_minHeap(0);

minheap.insert_minHeap(-1);

minheap.printHeap();
minheap.deleteMin();

minheap.printHeap();

You might also like