public void pointerRev()
{
node prev = this.head;
node curr = prev.next;
while(curr != null )
{
node ahead = curr.next;
curr.next = prev;
prev = curr;
curr = ahead;
}
node temp = this.head;
this.head = this.tail;
this.tail = temp;
}