class Node:
   def __init__(self, my_data):
      self.prev = None
      self.data = my_data
      self.next = None
class reverse_list:
   def __init__(self):
      self.head = None
      self.tail = None
   def add_data(self, my_data):
      new_node = Node(my_data)
      if(self.head == None):
         self.head = self.tail = new_node;
         self.head.previous = None;
         self.tail.next = None;
      else:
         self.tail.next = new_node;
         new_node.previous = self.tail;
         self.tail = new_node;
         self.tail.next = None;
   def reverse_vals(self):
      curr = self.head;
      while(curr != None):
         temp = curr.next
         curr.next = curr.previous
         curr.previous = temp
         curr = curr.previous
      temp = self.head
      self.head = self.tail
      self.tail = temp
   def print_it(self):
      curr = self.head
      if (self.head == None):
         print("这个列表是空的")
         return
      print("节点是：")
      while curr != None:
         print(curr.data)
         curr = curr.next
my_instance = reverse_list()
print("将元素添加到链表中")
my_instance.add_data(10)
my_instance.add_data(14)
my_instance.add_data(24)
my_instance.add_data(17)
my_instance.add_data(22)
my_instance.print_it()
print("在双向链表中反转的节点是： ")
my_instance.reverse_vals()
my_instance.print_it()

将元素添加到链表中
节点是：
10
14
24
17
22
在双向链表中反转的节点是：
节点是：
22
17
24
14
10