public class HeapNode

{
int arr[];
int pointer=0;

HeapNode(int size)
{
arr = new int[size];

}
public int getParent(int i) return Math.floor(i/2);

public void swap(int i , int j)

{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;

public void insert(int value)

{
if(i<size)
{
arr[i] = value;
int k=i;
i++;
while(k>=0 && arr[parent(k)] > arr[k])
swap(k,parent(k));
k=parent(k);

}
else
System.out.println("Overflow");

public static void main(String[] args)

{
HeapNode a = new HeapNode();
a.insert(10);
a.insert(20);
a.insert(5);
System.out.println(a.arr[0]);

}
}