Python双向链表插入操作报AttributeError: 'NoneType' object has no attribute 'prev'错误求助

Hey there! Let's break down what's going wrong with your code and fix it step by step—no jargon, just straightforward explanations.

What's Causing the Error? #

The AttributeError: 'NoneType' object has no attribute 'prev' happens when you run doublyLL.insert(3,2) because:

1. First, your location == 1 branch (meant for inserting at the end of the list) has the same code as the location == 0 branch (inserting at the start). This messes up your list structure entirely.
2. After inserting 2 at location 1, your list ends up as 2 <-> 1 instead of the intended 1 <-> 2.
3. When you try to insert 3 at location 2, your code tries to access newNode.next.prev—but newNode.next is None (since 1 is the last node, its next points to None), and you can't call .prev on a None value.

Let's Fix the Code #

First, correct the location == 1 branch to properly insert at the tail. Then, we'll add small checks to avoid errors if the insertion location is out of bounds.

Here's the revised insert method:

def insert(self, value, location):
    if self.head is None:
        print("Linked list does not exist")
    else:
        newNode = Node(value)
        if location == 0:
            # Insert at the start
            newNode.prev = None
            newNode.next = self.head
            self.head.prev = newNode
            self.head = newNode
        elif location == 1:
            # Insert at the end (fixed logic!)
            newNode.next = None
            newNode.prev = self.tail
            self.tail.next = newNode
            self.tail = newNode
        else:
            # Insert at a specific middle location
            tempNode = self.head
            index = 0
            # Stop loop if we reach the end of the list early
            while index < location - 1 and tempNode is not None:
                tempNode = tempNode.next
                index += 1
            # Only proceed if the location is valid
            if tempNode is not None:
                newNode.next = tempNode.next
                newNode.prev = tempNode
                # Update the next node's prev only if it exists
                if tempNode.next is not None:
                    tempNode.next.prev = newNode
                tempNode.next = newNode
            else:
                print("Invalid location—list is shorter than the target position")

Key Fixes Explained #

1. Tail Insertion (location == 1):

   • We set newNode.prev to the current tail (instead of self.head)
   • Update the current tail's next to point to the new node
   • Finally, set self.tail to the new node so it becomes the new end of the list

2. Error Prevention Checks:

   • Added and tempNode is not None to the while loop to stop if we reach the end of the list before hitting the target location
   • Added a check to only execute insertion logic if tempNode exists (prevents inserting at a position longer than the list)
   • Added if tempNode.next is not None before accessing tempNode.next.prev—this eliminates the original None error entirely

Test the Fixed Code #

If you run this revised code:

doublyLL = DoublyLinkedList()
doublyLL.createDLL(1)
doublyLL.insert(2,1)
doublyLL.insert(3,2)

# Print the values to verify the list structure
print([node.value for node in doublyLL])

You'll get the output [1, 2, 3]—exactly what you expected!

内容的提问来源于stack exchange，提问作者Tahsan Samin