How do I insert a node in a doubly linked list?

How do I insert a node in a doubly linked list?

To insert a node in a doubly linked list, you need to adjust the pointers of the nodes involved. Do you want to insert at the beginning, end, or a specific position?

Let's say I want to insert at the end of the list.

First, create a new node. Then, traverse to the end of the list, update the last node's next pointer to the new node, and set the new node's previous pointer to the last node.

Can you show me a code example for that?

Sure! Here's a simple example in Python:

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

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

    def insert_at_end(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            return
        last = self.head
        while last.next:
            last = last.next
        last.next = new_node
        new_node.prev = last

This code defines a doubly linked list and a method to insert a node at the end.