class Node: def __init__(self, data): self.data = data self.prev = None self.next = None class DoublySortedLinkedList: def __init__(self): self.head = None self.count = 0 def append(self, node): if self.count == 0: self.head = node self.count = 1 else: cur_node = self.head prev_node = None # cur_node의 data와 node의 data를 비교하며 삽입 위치 파악 while(cur_node != None and cur_node.data