public DLL ReverseNode()
{
DLNode tempPointer = Head;
DLNode runner = Head;
while (runner != null)
{
tempPointer = runner.Next;
runner.Next = runner.Prev;
runner.Prev = tempPointer;
runner = runner.Prev;
}
return(this);
}
public void RemoveLast()
{
if (Head == Tail)
{
Console.WriteLine("I aint got no tail");
}
else
{
DLNode temp = Tail.Prev;
Console.WriteLine(temp.Value);
Tail.Prev = null;
Tail = temp;
Tail.Next = null;
Count -= 1;
}
}
public DLL ReverseVal()
{
DLNode Runner = Head;
DLNode Rennur = Tail;
int size = Count;
for (int i = 0; i < size / 2; i++)
{
int temp = Runner.Value;
Runner.Value = Rennur.Value;
Rennur.Value = temp;
Runner = Runner.Next;
Rennur = Rennur.Prev;
}
return(this);
}
public void PushBack(int val)
{
DLNode newNode = new DLNode(val);
if (Head == null)
{
Tail = newNode;
Head = newNode;
Count += 1;
}
else
{
Count += 1;
Tail.Next = newNode;
newNode.Prev = this.Tail;
Tail = newNode;
}
}
public DLL()
{
Tail = null;
Head = null;
Count = 0;
}
