예제 #1
0
class Stack:
    def __init__(self):
        self.size = 0
        self.storage = LinkedList()

    def __str__(self):
        return self.storage.__str__()

    def __len__(self):
        return self.size

    def push(self, value):
        self.size += 1
        return self.storage.add_to_tail(value)

    def pop(self):
        if self.size != 0:
            self.size -= 1
            return self.storage.remove_tail()
        else:
            return None
예제 #2
0
class Queue:
    def __init__(self):
        self.size = 0
        self.storage = LinkedList()

    def __str__(self):
        return self.storage.__str__()

    
    def __len__(self):
        return self.size

    def enqueue(self, value):
        self.size += 1
        return self.storage.add_to_tail(value)

    def dequeue(self):
        if self.size != 0:
            self.size -= 1
            return self.storage.remove_head()
        else:
            return None