input: from typing import List
  
  def test_double_linked_list(operations: List[str], data: List[any]) -> List[any]:
      """ This function takes a list of operations ('append', 'prepend', or 'reverse') and corresponding data. 
      It simulates the operations on a double linked list and returns the concatenated data in the list after each operation.
      Example:
      >>> test_double_linked_list(['append', 'append', 'reverse', 'append'], [1, 2, None, 3])
      ['1', '12', '21', '213']
      """
      dll = DoubleLinkedList()
      result = []
      current_list = []
      
      for op, d in zip(operations, data):
          if op == 'append':
              dll.append(d)
          elif op == 'prepend':
              dll.prepend(d)
          elif op == 'reverse':
              dll.reverse()
          
          current_list.clear()
          node = dll.head
          while node:
              current_list.append(str(node.data))
              node = node.next
          
          result.append("".join(current_list))
      
      return result
output:     class Node:
          def __init__(self, data):
              self.data = data
              self.next = None
              self.prev = None
  
      class DoubleLinkedList:
          def __init__(self):
              self.head = None
              self.tail = None
  
          def append(self, data):
              new_node = Node(data)
              if not self.head:
                  self.head = new_node
                  self.tail = new_node
              else:
                  new_node.prev = self.tail
                  self.tail.next = new_node
                  self.tail = new_node
  
          def prepend(self, data):
              new_node = Node(data)
              if not self.head:
                  self.head = new_node
                  self.tail = new_node
              else:
                  new_node.next = self.head
                  self.head.prev = new_node
                  self.head = new_node
  
          def reverse(self):
              current = self.head
              while current:
                  current.next, current.prev = current.prev, current.next
                  current = current.prev
              self.head, self.tail = self.tail, self.head