Doubly Linked List Visualization

function insertAt(index, value):

    if index == 0:

        insertAtHead(value)

        return

    cur = head

    for i = 1 to index:

        if cur.next is null: break

        cur = cur.next

    node = new Node(value)

    node.next = cur.next

    node.prev = cur

    if cur.next is not null:

        cur.next.prev = node

    cur.next = node

function deleteAt(index):

    cur = head

    for i = 0 to index:

        prev = cur

        cur = cur.next

    if cur.next is not null:

        cur.next.prev = prev

    prev.next = cur.next