Scribd
Upload
3 views

JAVA CODE

Uploaded by

seralathan s
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
3 views

JAVA CODE

Uploaded by

seralathan s
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

// public class ListNode {

// int val;
// ListNode next;
//
// public ListNode(int val) {
// this.val = val;
// this.next = null;
// }
// }

public class Queue {


ListNode left; // front of Queue front -> [1,2,3]
ListNode right; // back of Queue [1,2,3] <- back

public Queue() {
this.left = null;
this.right = null;
}

public void enqueue(int val) {


ListNode newNode = new ListNode(val);
if (this.right != null) {
// Queue is not empty
this.right.next = newNode;
this.right = this.right.next;
} else {
// Queue is empty
this.left = newNode;
this.right = newNode;
}
}

public int dequeue() {


if (this.left == null) {
// Queue is empty
System.exit(0);
}
int val = this.left.val;
this.left = this.left.next;
return val;

public void print() {


ListNode cur = this.left;
while(cur != null) {
System.out.print(cur.val + " -> ");
cur = cur.next;
}
System.out.println();
}

You might also like