queue | Chinese Rule of Eight

For queues, we append new node at the tail end, and the tail take on its next.

The head pointer stays in place at the first node. When we execute something, we pop from the queue, and the head moves to next.

using System;

public class Program

{

//create reference type Node

public class Node

{

public Node next;

public Object data;

public Node(Object newData, Node newNext) {

next = newNext;

data = newData;

}

public class Queue {

private Node head; //head points to the beginning of the queue. We pop by using the head.

private Node tail; //tail points to the end of the queue. We append using the tail

public void push(Object newData) {

if((head == null) && (tail == null)) {

head = tail = new Node(newData, null);

Console.WriteLine("+ pushed {0} onto the Queue", newData);

return;

}

tail.next = new Node(newData, null);

tail = tail.next;

Console.WriteLine("+ pushed {0} onto the Queue", newData);

}

public void pop() {

if(head != null) {

Node toRemove = head;

head = head.next;

Console.WriteLine("- popped {0} onto the Queue", toRemove.data);

toRemove.data = null;

toRemove.next = null;

} else {

Console.WriteLine("Can't pop anymore, Queue is empty");

}

public void print() {

Console.WriteLine("************ START ************");

for (Node temp = head; temp != null; temp = temp.next) {

Console.WriteLine(temp.data);

}

Console.WriteLine("************ END ************");

}

public static void Main()

{

Console.WriteLine("Hello World");

GBTU g = new GBTU();

g.BTech();

//reference type LinkedList

Queue myList = new Queue();

myList.push("Ricky");

myList.push("Lily");

myList.push("Sophia");

myList.print();

myList.pop();

myList.print();

myList.pop();

myList.print();

myList.pop();

}