How can I implement a stack using a linked list?

How can I implement a stack using a linked list?

To implement a stack using a linked list, you need to create a linked list where each node contains a value and a pointer to the next node.

What operations should I include in my stack implementation?

You should include operations like push (to add an item), pop (to remove the top item), and peek (to view the top item without removing it).

Can you show me a simple code example?

Sure! Here's a basic implementation in Python:

class Node:
    def __init__(self, value):
        self.value = value
        self.next = None

class Stack:
    def __init__(self):
        self.top = None

    def push(self, value):
        new_node = Node(value)
        new_node.next = self.top
        self.top = new_node

    def pop(self):
        if self.is_empty():
            return None
        popped_value = self.top.value
        self.top = self.top.next
        return popped_value

    def peek(self):
        return self.top.value if self.top else None

    def is_empty(self):
        return self.top is None

What are the advantages of using a linked list for a stack?

Using a linked list allows for dynamic memory allocation, meaning the stack can grow and shrink as needed without a predefined size limit.