How can I implement a queue and a stack in code?

How can I implement a queue and a stack in code?

You can implement a queue using a list or a linked list. For a stack, you can also use a list. Would you like examples in Python?

Yes, please provide examples in Python.

Sure! Here's a simple implementation of a stack:

class Stack:
    def __init__(self):
        self.items = []

    def push(self, item):
        self.items.append(item)

    def pop(self):
        return self.items.pop() if not self.is_empty() else None

    def is_empty(self):
        return len(self.items) == 0

    def peek(self):
        return self.items[-1] if not self.is_empty() else None

Great! Can you show me how to implement a queue as well?

Of course! Here's a simple implementation of a queue:

class Queue:
    def __init__(self):
        self.items = []

    def enqueue(self, item):
        self.items.insert(0, item)

    def dequeue(self):
        return self.items.pop() if not self.is_empty() else None

    def is_empty(self):
        return len(self.items) == 0

    def peek(self):
        return self.items[-1] if not self.is_empty() else None