Can anyone help me to complete my following program??
im****t java.util.vector;
class Heap{
Vector data;
void insert(Object obj) {
int loc=data.size();
data.addatLastLoc(obj);
while(loc != 0){
int parent = floor((loc-1)/2);
Object par = data.getIthElement(parent);
if(par.compareTo(obj)<=0) break;
Object temp = par;
data.replaceIthElement(parent,obj);
data.replaceIthElement(loc,temp);
loc = parent;
obj= data.getIthElement(loc);
}
Object removeMin(){
int loc = data.size()-1;
swap(root && loc objects)
int curr =0;
int leftchild=curr*2+1;
int rightchild = curr*2+2;