How can I implement advanced operations on linked lists in Python?

How can I implement advanced operations on linked lists in Python?

You can implement operations like reversing a linked list, merging two lists, or finding the middle element. Which one would you like to start with?

Let's start with reversing a linked list.

To reverse a linked list, you can use an iterative approach. Here's a simple implementation:

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

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

    def reverse(self):
        prev = None
        current = self.head
        while current:
            next_node = current.next  # Store next node
            current.next = prev       # Reverse the link
            prev = current            # Move prev and current one step forward
            current = next_node
        self.head = prev

Would you like to see how to use this function?

Yes, how do I use the reverse function?

You can use the reverse function like this:

ll = LinkedList()
ll.head = Node(1)
ll.head.next = Node(2)
ll.head.next.next = Node(3)

ll.reverse()

After calling ll.reverse(), the linked list will be reversed. Would you like to know more about other operations?