X Tutup
package queue; import linkedLists.MyLinkedList.Node; public class MyQueue { private Node head, rear; public void enqueue(E e) { Node toAdd = new Node<>(e); if (head == null) { head = rear = toAdd; return; } rear.next = toAdd; rear = rear.next; } public E dequeue() { if (head == null) { return null; } Node temp = head; head = head.next; if (head == null) { rear = null; } return temp.data; } }
X Tutup