explain this codes : class Heap { int [] heapArray; int maxSize, heapSize; public Heap(int max) { maxSize=max; heapSize=0;
explain this codes :
class Heap
{
int [] heapArray;
int maxSize, heapSize;
public Heap(int max)
{
maxSize=max;
heapSize=0;
heapArray = new int[maxSize];
}
public boolean insert(int ele)
{
if((heapSize+1) == maxSize)
return false;
heapArray[++heapSize]=ele;
int pos = heapSize;
while(pos != 1 && ele < heapArray[pos/2])
{
heapArray[pos] = heapArray[pos/2];
pos = pos/2;
}
heapArray[pos] = ele;
return true;
}
public void displayHeap()
{
System.out.println("The contents of heap are: ");
for(int i = 1;i <= heapSize;i++)
System.out.print(heapArray[i]+" ");
}
}
public class HeapTest {
public static void main(String args[]){
Heap h=new Heap(7);
h.insert(7);
h.insert(8);
h.insert(2);
h.insert(4);
h.insert(12);
h.insert(5);
h.displayHeap();
}
}
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 5 images
