Question

I need help writing java code for the Binary Heap Priority Queue assignment. Task:

// Deletes all instances of the parameter obj from the PQ if found, and returns true. Returns false if no match to the parameter obj is found.

public boolean delete(E obj); // provided ADT

How can I write this in O(logn)? assuming you are using Sink/Swim (insert/remove) operations

Additional info:

Each method must be as efficient as possible. That is, an O(n) is unacceptable if the method could be written with O(log n) complexity. Both insert and remove must be O(log n).

 Your BinaryHeap must be stable--able to determine the oldest entry among those with identical priority.

 Your iterator must be fail-fast.

 You may not make any modifications to the PriorityQueue interface provided. I will grade your project with my copy of this file.

 All relevant requirements from earlier assignments apply here.

Answer 1

import .java .util.*;

class priority{

public static int[]  insert(int a[])

{

int a[]=new int[];

PriorityQueue<String> pQueue =

                          new PriorityQueue<String>();

Iterator itr = pQueue.iterator();

Scanner input=new scanner(System.in);
        
        System.out.print("Enter an value: ");

        while (itr.hasNext())

{

int a[]= input.nextInt();

a[]=pQueue.add(itr.next());

a++;

}

return a[ ];

}

public boolean delete(obj[])

{

if(comparator.obj[]=comparator.obj[])

{

iterator<String> itr2 = pQueue.iterator();

        while (itr2.hasNext())

pQueue.remove(obj[]);

return true;

}

else

return false;

}

public class main()

{

public static void main()

{   

int[] obj=insert(s[]);

boolean j=delete(obj[]);

}

}