explain this codes : class Heap {     int [] heapArray;      int maxSize, heapSize;        public Heap(int max)        {         maxSize=max;         heapSize=0;

Answer in 5 mins else downvote

public class HeapPriQ<T> implements PriQueueInterface<T>{  protected ArrayList<T> elements;  // priority queue elements  protected int lastIndex;          // index of last element in priority queue  protected int maxIndex;           // index of last position in ArrayList   protected Comparator<T> comp;   public HeapPriQ(int maxSize)  // Precondition: T implements Comparable  {    elements = new ArrayList<T>(maxSize);    lastIndex = -1;    maxIndex = maxSize - 1;     comp = new Comparator<T>()    {       public int compare(T element1, T element2)       {         return ((Comparable)element1).compareTo(element2);       }    };  }   public HeapPriQ(int maxSize, Comparator<T> comp)  // Precondition: T implements Comparable  {    elements = new ArrayList<T>(maxSize);    lastIndex = -1;    maxIndex = maxSize - 1;     this.comp = comp;  }   public boolean isEmpty()  // Returns true if this priority queue is empty; otherwise, returns false.  {…

Complete the code. The question is in the picture       #include <iostream> using namespace std; class Queue { int size; int* queue; public: Queue() { size = 0; queue = new int[100]; } void add(int data) { queue[size] = data; size++; } void remove() { if (size == 0) { cout << "Queue is empty"<<endl; return; } else { for (int i = 0; i < size - 1; i++) { queue[i] = queue[i + 1]; } size--; } } void print() { if (size == 0) { cout << "Queue is empty"<<endl; return; } for (int i = 0; i < size; i++) { cout<<queue[i]<<" <- "; } cout << endl; } Queue operator+(Queue &obj) {         Queue res;         for(int i=0;i<this->size;i++) {             res.add(this->queue[i]);         }         for(int i=0;i<obj.size;i++) {             res.add(obj.queue[i]);         }         return res;     } }; //your code goes here int main() { Queue q1; q1.add(42); q1.add(2); q1.add(8);  q1.add(1);     q1.print();     Queue2 q2; q2.add(3);…

Simple JAVA linkedlist code implementation please help and complete any part you can - Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of LinkedList interface- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Build Bus Route – Linked List- Your task is to:o Implement the LinkedList interface (fill out the implementation shell)o Put your implementation through its paces by exercising each of themethods in the test harnesso Create a client (a class with a main) ‘BusClient’ which builds a busroute by performing the following operations on your linked list:o§ Create (insert) 4 stations§ List the stations§ Check if a station is in the list (print result)• Check for a station that exists, and onethat doesn’t§ Remove a station§ List the stations§ Add a station before another station§ List the stations§ Add a station after another station§ Print the…