Learning Queues in Java, any help is appreciated, will leave positive review!

PQTester:

import java.util.Queue; import java.util.Arrays; import java.util.ArrayList; import java.util.LinkedList; import java.util.PriorityQueue; public class PQTester { private Queue pQueue; public PQTester() { } public PQTester(String list) { } public void setPQ(String list) { } public Object getMin() { return ""; } public String getNaturalOrder() { String output=""; return output; } //write a toString method }

PQTestRunner:

public class PQTestRunner { public static void main ( String[] args ) { //add test cases } }

A+ Computer Science PRIORITY QUEUES Lab Goal: This lab was designed to teach you more about using a Priority Queue. Lab Description: Read a list of Strings. Store the Strings in the PriorityQueue and display the list in priority queue order, display the min value, and display the queue in natural order. Files Needed :: Sample Data : one two three four five six seven 1 2 3 4 5 one two three four five a phje fmci dkig nob PQTest.java PQTestRunner.java Sample Output: toString() - [five, four, seven, two, one, three, six] getMin() - five getNaturalOrder() - five four one seven six three two toString() - [1, 3, 2, 4, 5, three, five, two, four, one] getMin() - 1 get NaturalOrder() - 1 2 3 4 5 five four one three two toString() - (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) getMin() - a getNaturalOrder() - a b c d e fghijklmnop BASIC PRIORITYQUEUE CODE PriorityQueue pq; pq = new PriorityQueue(); pg.add(67); pq.add(34); pq.add (12): out.println(pq.remove()); //outs 12 out.println(pq.remove()); //outs 34 out.println(pg.remove()); //outs 67 PriorityQueue is a minimum heap with the smallest value at root. A+ Computer Science - Queues - www.apluscompsci.com