Here is a Python solution for reversing a linked list:

```python
class Node:
def __init__(self, data=None):
self.data = data
self.next = None

class LinkedList:
def __init__(self):
self.head = None

def insert(self, data):
if not self.head:
self.head = Node(data)
else:
new_node = Node(data)
cur = self.head
while cur.next:
cur = cur.next
cur.next = new_node

def display(self):
elements = []
cur_node = self.head
while cur_node:
elements.append(cur_node.data)
cur_node = cur_node.next
return elements

def reverse(self):
prev = None
current = self.head
while current:
nxt = current.next
current.next = prev
prev = current
current = nxt
self.head = prev

# Test the code
llist = LinkedList()
llist.insert(67)
llist.insert(45)
llist.insert(12)
print("Original List: ", llist.display())
llist.reverse()
print("Reversed List: ", llist.display())
```

In this code, we first create a linked list with the `LinkedList` class. The `insert` method is used to add elements to the list. The `display` method is used to print the elements of the list.

The `reverse` method is where the reversal of the linked list happens. We initialize three pointers: `prev`, `current`, and `nxt`. We traverse the list, at each iteration, we reverse the `next` pointer of the `current` node to point to the `prev` node. Then, we move the `prev` and `current` pointers one step forward. At the end of the traversal, we point the `head` of the list to the `prev` pointer (which is now pointing at the last node), thus achieving the reversal of the linked list.

Question

Here is a Python solution for reversing a linked list:

```python
class Node:
    def __init__(self, data=None):
        self.data = data
        self.next = None

class LinkedList:
    def __init__(self):
        self.head = None

def insert(self, data):
        if not self.head:
            self.head = Node(data)
        else:
            new_node = Node(data)
            cur = self.head
            while cur.next:
                cur = cur.next
            cur.next = new_node

def display(self):
        elements = []
        cur_node = self.head
        while cur_node:
            elements.append(cur_node.data)
            cur_node = cur_node.next
        return elements

def reverse(self):
        prev = None
        current = self.head
        while current:
            nxt = current.next
            current.next = prev
            prev = current
            current = nxt
        self.head = prev

# Test the code
llist = LinkedList()
llist.insert(67)
llist.insert(45)
llist.insert(12)
print("Original List: ", llist.display())
llist.reverse()
print("Reversed List: ", llist.display())
```

In this code, we first create a linked list with the `LinkedList` class. The `insert` method is used to add elements to the list. The `display` method is used to print the elements of the list.

The `reverse` method is where the reversal of the linked list happens. We initialize three pointers: `prev`, `current`, and `nxt`. We traverse the list, at each iteration, we reverse the `next` pointer of the `current` node to point to the `prev` node. Then, we move the `prev` and `current` pointers one step forward. At the end of the traversal, we point the `head` of the list to the `prev` pointer (which is now pointing at the last node), thus achieving the reversal of the linked list.

Knowee AI · Accepted Answer