def sortedInsert(llist, data):
    node = llist
    dummy = DoublyLinkedListNode(0)
    dummy.next = node
    prev = dummy
    
    data = DoublyLinkedListNode(data)
    
    while node:
        if node.data >= data.data:
            break
        prev = node
        node = node.next
    
    prev.next = data
    data.prev = prev
    data.next = node
    if node:
        node.prev = data
    
    return dummy.next