@@ -0,0 +1,52 @@
+class Node:
+    def __init__(self, value = None):
+        self.value = value
+        self.root = None
+        self.left = None
+        self.right = None
+
+    def insertNodeAtLeft(self, node):
+        self.left = node
+        self.left.root = self.root
+
+    def insertNodeAtRight(self, node):
+        self.right = node
+        self.right.root = self.root
+
+    def printTree(self):
+        print(self.value)
+        node1 = self
+        node2 = self
+        while (node1.left is not None):
+            print(node1.left.value, end = " ")
+            if (node1.left.left is not None):
+                print(node1.left.left.value, end = " ")
+            if (node1.left.right is not None):
+                print(node1.left.right.value)
+            node1 = node1.left
+        while (node2.right is not None):
+            print(node2.right.value)
+            if (node2.right.left is not None):
+                print(node2.right.left.value, end = " ")
+            if (node2.right.right is not None):
+                print(node2.right.right.value)
+            node2 = node2.right
+
+
+if __name__ == "__main__":
+    node1 = Node(1)
+    node1.insertNodeAtLeft(Node(2))
+    node1.insertNodeAtRight(Node(3))
+    #node1.printTree()
+
+    node2 = Node(23)
+    node2.insertNodeAtLeft(Node(42))
+    node2.insertNodeAtRight(node1)
+    #node2.printTree()
+
+    node3 = Node(69)
+    node3.insertNodeAtLeft(node1)
+    node3.insertNodeAtRight(node1)
+    node3.printTree()
+
+
@@ -0,0 +1,46 @@
+class Node:
+    def __init__(self, value = None):
+        self.value = value
+        self.next = None
+
+class LinkedList:
+    def __init__(self):
+        self.head = None
+
+    def printList(self):
+        node = self.head
+        while node is not None:
+            print(node.value)
+            node = node.next
+
+    def findNode(self, node):
+        innerNode = self.head
+        while innerNode is not None:
+            if (innerNode.value == node.value):
+                return True
+            innerNode = innerNode.next
+        return False
+
+    def insertAtHead(self, node):
+        node.next = self.head
+        self.head = node
+
+    def insertAtBottom(self, node):
+        if (self.head is None):
+            self.head = node
+        else:
+            innerNode = self.head
+            while innerNode.next is not None:
+                innerNode = innerNode.next
+            innerNode.next = node
+
+
+if __name__ == "__main__":
+    linkedlist1 = LinkedList()
+    linkedlist1.insertAtHead(Node(1))
+    linkedlist1.insertAtHead(Node(2))
+    linkedlist1.insertAtHead(Node(3))
+    linkedlist1.insertAtBottom(Node(69))
+    linkedlist1.printList()
+    print(linkedlist1.findNode(Node(1)))
+    print(linkedlist1.findNode(Node(42)))
@@ -0,0 +1,38 @@
+class Node:
+    def __init__(self, value):
+        self.value = value
+        self.next = None
+
+class Queue:
+    def __init__(self):
+        self.head = None
+
+    def enqueue(self, node):
+        if (self.head is None):
+            self.head = node
+        else:
+            innerNode = self.head
+            while(innerNode.next is not None):
+                innerNode = innerNode.next
+            innerNode.next = node
+        
+    def dequeue(self):
+        self.head = self.head.next
+
+    def printQueue(self):
+        node = self.head
+        while(node is not None):
+            print(node.value)
+            node = node.next
+       
+
+if __name__ == "__main__":
+    queue1 = Queue()
+    queue1.enqueue(Node(1))
+    queue1.enqueue(Node(2))
+    queue1.enqueue(Node(3))
+    queue1.printQueue()
+    print("------------------")
+    queue1.dequeue()
+    queue1.printQueue()
+    print("------------------")
@@ -0,0 +1,39 @@
+from multiprocessing.sharedctypes import Value
+
+
+class Node:
+    def __init__(self, value):
+        self.value = value
+        self.next = None
+
+class Stack:
+    def __init__(self):
+        self.head = None
+
+    def push(self, node):
+        node.next = self.head
+        self.head = node
+
+    def pop(self):
+        if (self.head is not None):
+            self.head = self.head.next
+
+    def printStack(self):
+        node = self.head
+        while (node is not None):
+            print(node.value)
+            node = node.next
+
+if __name__ == "__main__":
+    stack1 = Stack()
+    stack1.push(Node(1))
+    stack1.push(Node(23))
+    stack1.push(Node(42))
+    stack1.printStack()
+    stack1.pop()
+    print("------------------")
+    stack1.printStack()
+    stack1.pop()
+    stack1.pop()
+    print("------------------")
+    stack1.printStack()