public DoublyLinkedList <T> InsertPrev(T data)
{
DoublyLinkedList <T> node = new DoublyLinkedList <T>(data);
if (this.prev == null)
{
node.prev = null;
node.next = this;
this.prev = node;
}
else
{
// Insert in the middle
DoublyLinkedList <T> temp = this.prev;
node.prev = temp;
node.next = this;
this.prev = node;
temp.next = node;
}
return(node);
}
public DoublyLinkedList(T data)
{
this.data = data;
next = null;
prev = null;
}
public DoublyLinkedList()
{
data = default(T);
next = null;
prev = null;
}
