class Node:
def __init__(self, item=None, link=None):
self.item = item
self.link = link
class CircleLinkedList:
def __init__(self):
self.root = None
def append(self, item):
curNode = self.root
newNode = Node(item)
if self.root is None:
self.root = newNode
newNode.link = self.root
else:
while curNode.link is not self.root:
curNode = curNode.link
curNode.link = newNode
newNode.link = self.root
'자료구조' 카테고리의 다른 글
Factorial, Fibonacci (0) | 2024.10.28 |
---|---|
Queue (0) | 2024.10.28 |
Stack (0) | 2024.10.28 |
Transpose of Sparse Matrix (0) | 2024.10.28 |
Single Linked List (0) | 2024.10.28 |