Doubly Linked List1 [자료구조] Doubly Linked List 구현 class Node: def __init__(self, item): self.data = item self.prev = None self.next = None class DoublyLinkedList: def __init__(self): self.nodeCount = 0 self.head = Node(None) self.tail = Node(None) self.head.prev = None self.head.next = self.tail self.tail.prev = self.head self.tail.next = None def reverse(self): result = [] curr = self.tail while curr.prev.prev: curr = curr.prev result.append(c.. 2021. 4. 20. 이전 1 다음