Added notebook solving the following: Implement a stack with push, pop, and peek methods using a linked list.

stacks-queues/stack.py

@@ -0,0 +1,26 @@
+
+class Node(object):
+    def __init__(self, data):
+        self.data = data
+        self.next = None
+
+class Stack(object):
+    def __init__(self, top=None):
+        self.top = top
+
+    def push(self, data):
+        node = Node(data)
+        node.next = self.top
+        self.top = node
+
+    def pop(self):
+        if self.top is not None:
+            data = self.top.data
+            self.top = self.top.next
+            return data
+        return None
+
+    def peek(self):
+        if self.top is not None:
+            return self.top.data
+        return None