Java programming HW: Implement the queue interface in ourArrayList. Modify ourArrayList to implement wQueue interface. Ill attach imaged of "ourarraylist"code: package com.mac286.ourArrayList;public interface wQueue <T>{public boolean empty();public T remove();public void insert(T e);public int size();public String toString(); } package com.mac286.ourArrayList;/*Design a linked list with the following properties:* 1- A reference to the first node (Head) and a reference to the last node (Tail)* 2- keep track of the size of the list int size* 3- Constructor to create an empty list* 4- getter for size* 5- isEmpty() returns true it the list is empty and false othewise.* 6- method void add (T e) that adds e to the back of the list. Like a queue* 7- method void add (T e, int ind) that adds element e at the specified index.* 8- method T remove() that removes the head and returns it (like a queue)* 9- method T remove (int ind) removes the element at index ind and returns it.* 10- method T get (int ind) returns the element at index ind without removing it.* 11- tostring that displays the content of the list from the head to the tail between brackets []public class ourArrayList{private Node Head = null;private Node Tail = null;private int size = 0;//default constructorpublic ourArrayList() {Head = Tail = null;size = 0;}public int size() {return size;}public boolean isEmpty() {return (size == 0);}//implement the method add, that adds to the back of the listpublic void add(T e) {//HW TODO and TEST//create a node and assign e to the data of that node.Node N = new Node ( );//N.mData is null and N.next is null as wellN.setsData (e);//chain the new node to the list//check if the list is empty, then deal with the special caseif(this.isEmpty()) {//head and tail refer to Nthis.Head = this.Tail = N;size++;//return we are done.return;}//The list is not empty//if the list is not empty. Then update the link of the last element to refer to the//new node then update Tail to refer to the new node.Tail.setNext(N);Tail = N;//increase size.size++;}//remove removes the first/head and returns it.public T remove() {//check if empty then return nullif(this.isEmpty()) {return null;}//it is not empty//save the returned itemT save = this.Head. getData();//Head should refer to the next nodethis.Head = this.Head.getNext();if(this.Head == null) {this.Tail = null;}size--;return save;}//T get (int ind)public T get(int ind) {returns the element at index ind without removing it.//if list is empty return null////if index is smaller than 0 or larger than size-1 return nullif(this.isEmpty() || ind < 0 || ind > size - 1) {return null;}//create a temp reference, starting at Head.Node temp = this.Head;//loop through the list ind times and return the data at the node.for (int i = 0; i < ind; i++) { for (int i = 0; i < ind; i++) {//move to the nexttemp = temp.getNext();}//temp should refer to the node you are looking for. return the data in that nodereturn temp.getData();}public void add(int ind, T e) {//if ind is not valid returnif(ind < 0 || ind > size) {return;}//if ind == size just call add(e), add it to the backif(ind == size) {//insert at the end just call add (e)this.add(e);return;}//create a new node with e as dataNode N = new Node (e);//if ind == 0; //add it ot the head as a special case and returnif(ind == 0) {N.setNext(this.Head);Нead %3D N;size++;return;}//The index is somewhere in between.//Go to node ind - 1 and insert your Node.Node temp = this. Head;for (int i =0; i= size)return null;if(ind == 0)return this.remove(0;//The index is in between, go to the node before the one to remove//create temporary reference tempNode temp = this.Head;for (int i = 0; i < ind-1; i++)temp = temp.getNext();//temp refers to the node before the one to remove.//save what to returnT save = temp.getNext().getData();//create the connection to the one aftertemp.setNext(temp.getNext().getNext());//Tail may need to be updated in case we are removing the last one.if(temp.getNext() == null)Tail = temp;size--;return save;public String toString() {if(this.isEmpty())return "[]";String st = "[";//create a temp reference to the first node.Node temp = this.Head;while(temp.getNext() != null) {//go through all nodes until the last and add the content to the string.st += temp.toString() + ", ";//go to the next nodetemp = temp.getNext();}//temp should poinrt to the last element at this pointst += temp.toString() + "]";return st;}}

The FIFO rule governs the queue, which is a linear data structure (first in first out). Not just…

Answered: Implement the queue interface in…

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE