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

• 1.
• 2.
• 3.
• 4.
• 5.

class DoublyLinkedList:
def _init_(self):
self.head =None
def append(self, data):
if not self.head:
self.head =Node(data)
else:
current =self.head
while current.next:
current =current.next
current.next=Node(data)
current.next.prev= current
def replace_element(self, old_data, new_data):
current=self.head
while current:
if current.data == old_data:
current.data=new_data
return True#
current =current.next
return False#找素
def display(self):
elements=[]
current_node =self.head
while current_node:
elements. append(current_node.data)
current_node = current_node.next
return elements

• 1.
• 2.
• 3.
• 4.
• 5.
• 6.
• 7.
• 8.
• 9.
• 10.
• 11.
• 12.
• 13.
• 14.
• 15.
• 16.
• 17.
• 18.
• 19.
• 20.
• 21.
• 22.
• 23.
• 24.
• 25.
• 26.
• 27.