1. A queue is a data structure with three main possible operations: 1) enqueue, 2) dequeue, and 3) peek. Assume that we

[answerhappygod]

1 A Queue Is A Data Structure With Three Main Possible Operations 1 Enqueue 2 Dequeue And 3 Peek Assume That We 1 (20.54 KiB) Viewed 49 times

1. A queue is a data structure with three main possible operations: 1) enqueue, 2) dequeue, and 3) peek. Assume that we want to make a class 'Queue' using the Node class shown below. Write each of the aforementioned methods within the class 'Queue' solely using linked list nodes. For full marks, you should use java. For part marks, write your solution in pseudocode. Don't forget comments! Class Node { public int data; public Node nextNode; public Node(int data) { this.data = data; this.next = null; } } Class Queue { Private static Node rear = null; Private static int count = 0; Public static int dequeue() { } Public static int enqueue() { } Public static peek() { }