public void ReverseLinkedList() { if (this.Head == null) return; Node newNode = new Node(this.Head.data); Node first = newNode; Node temp = this.Head.next; while(temp != null) { newNode = new Node(temp.data); newNode.next = first; first = newNode; temp = temp.next; } this.Head = first; }