LinkedList

Llist.py

class Node :
    def __init__(self,data,nxt=None):
        self.__nxt = nxt
        self.__data = data
    def getData(self): 
        return self.__data
    def getNext(self):
        return self.__nxt
    def setNext(self,nxt):
        self.__nxt = nxt

class Llist :
    def __init__(self):
        dummy = Node(None)
        self.head = dummy # 시작점
        self.end = dummy # 제일 끝의 노드
    def add(self,node):
        if self.head.getData() == None:
            self.head = node
            self.end = node
        else :
            self.end.setNext(node)
            self.end = node
    def search(self,item):
        pre = None
        cur = self.head
        while True:
            if cur.getData() == item : return pre,cur
            if cur.getNext() == None : break
            pre = cur
            cur = cur.getNext()
        return None, None
    def delete(self,item):
        pre,cur = self.search(item)
        pre.setNext(cur.getNext())
        del cur
    def printAll(self):
        cur = self.head
        while True:
            print(cur.getData(),end='')
            if cur.getNext() == None: break
            print(' -> ',end='')
            cur = cur.getNext()
        print()