Question: Task 2 (30 pts). Implement the enqueueint x), dequeue() function for Queue in Queue.java as discussed in Lecture 5. public class Queue { Press Esc


![Press Esc to exit full screen public int size; public int[] array;](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3e7831faaf_54666f3e782b6603.jpg)

Task 2 (30 pts). Implement the enqueueint x), dequeue() function for Queue in Queue.java as discussed in Lecture 5. public class Queue { Press Esc to exit full screen public int size; public int[] array; public int head; public int tail; public Queue () { size = 0; array = null; head = 0; tail = 0; } public Queue (int _size) { size = _size; array = new int[size]; head = 0; tail = 0; } /* * Implement the ENQUEUE(Q, x) function public void enqueue (int x) { } /* * Implement the DEQUEUE(Q) function */ public int dequeue () { } /* * Convert queue to string in the format of #size, head, tail, [#elements] public String toString ( { String str; str = size + ", " + head + ", " + tail + ", ["; for (int i = head; i%size
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
