insert method for a sorted doubly linked list in python

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

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

    def insert(self, data):
        new_node = Node(data)

        # If the list is empty, make the new node the head
        if self.head is None:
            self.head = new_node
            return

        # If the new node is smaller than the head, insert it before the head
        if self.head.data > data:
            new_node.next = self.head
            self.head.prev = new_node
            self.head = new_node
            return

        # Traverse the list to find the node with a larger value than the new node
        curr_node = self.head
        while curr_node.next is not None and curr_node.next.data < data:
            curr_node = curr_node.next

        # Insert the new node before the node with a larger value
        new_node.next = curr_node.next
        if curr_node.next is not None:
            curr_node.next.prev = new_node
        curr_node.next = new_node
        new_node.prev = curr_node
        
1135 chars
38 lines