// Iterative C# program to reverse a linked list

using System;

​

class Node {

    public int Data;

    public Node Next;

​

    public Node(int newData) {

        Data = newData;

        Next = null;

    }

}

​

// Given the head of a list, reverse the list and return the

// head of reversed list

class GfG {

    static Node ReverseList(Node head) {

        // Initialize three pointers: curr, prev and next

        Node curr = head;

        Node prev = null;

        Node next;

​

        // Traverse all the nodes of Linked List

        while (curr != null) {

            // Store next

            next = curr.Next;

​

            // Reverse current node's next pointer

            curr.Next = prev;

​

            // Move pointers one position ahead

            prev = curr;

            curr = next;

        }

​

        // Return the head of reversed linked list

        return prev;

    }

​

    static void PrintList(Node node) {

        while (node != null) {

            Console.Write(" " + node.Data);

            node = node.Next;

        }

        Console.WriteLine();

    }

​

    static void Main() {

        // Create a hard-coded linked list:

        // 1 -> 2 -> 3 -> 4 -> 5

        Node head = new Node(1);

        head.Next = new Node(2);

        head.Next.Next = new Node(3);

        head.Next.Next.Next = new Node(4);

        head.Next.Next.Next.Next = new Node(5);

​

        Console.Write("Given Linked list:");

        PrintList(head);

​

        head = ReverseList(head);

​

        Console.Write("Reversed Linked List:");

        PrintList(head);

    }

}