public CircularLinkedList()
{
dummyNode = new BackLinkedNode("dUmMy");
dummyNode.setNext(dummyNode);
size = 0;
}
public void setPrev(BackLinkedNode newPrev)
{
prev = newPrev;
}
public BackLinkedNode(string newData)
{
data = newData;
next = null;
prev = null;
}
public void setNext(BackLinkedNode newNext)
{
next = newNext;
}
public void insertAtFront(string newData)
{
BackLinkedNode newNode = null;
if (!String.Equals(newData, "dUmMy"))
{
//If the new data is not the same as the data contained in the dummy node, create a new Node and insert it into the front of the LinkedList
newNode = new BackLinkedNode(newData);
newNode.setNext(dummyNode.getNext());
dummyNode.getNext().setPrev(newNode);
newNode.setPrev(dummyNode);
dummyNode.setNext(newNode);
size++;
}
}