diff --git a/notes-and-examples/2026.01.21/main.py b/notes-and-examples/2026.01.21/main.py
new file mode 100644
index 0000000..a69ab6f
--- /dev/null
+++ b/notes-and-examples/2026.01.21/main.py
@@ -0,0 +1,25 @@
+def bubble_sort_example():
+    numbers = [5, 24, 18, 95, 45, 502, 1]
+
+    for i in range(len(numbers)):
+        for j in range(i, len(numbers)):
+            if numbers[i] > numbers[j]:
+                numbers[j], numbers[i] = numbers[i], numbers[j]
+
+
+    print(numbers)
+
+def insertion_sort_example():
+    numbers = [5, 24, 18, 95, 502, 45, 1]
+
+    for i in range(1, len(numbers)):
+        for j in range(i - 1, -1, -1):
+            if numbers[j] > numbers[j + 1]:
+                numbers[j + 1], numbers[j] = numbers[j], numbers[j + 1]
+            else:
+                break
+
+    print(numbers)
+
+# bubble_sort_example();
+insertion_sort_example();
diff --git a/notes-and-examples/2026.01.28/full_linked_list.py b/notes-and-examples/2026.01.28/full_linked_list.py
new file mode 100644
index 0000000..a05a729
--- /dev/null
+++ b/notes-and-examples/2026.01.28/full_linked_list.py
@@ -0,0 +1,35 @@
+class Node:
+    next_node = None
+
+    def __init__(self, value):
+        self.value = value
+
+# Homework:
+# Make a linked list class with the functions:
+# - append(node): add a node to the end of the list
+# - insert(node, index): add a node to the middle of the list
+# - remove(index): remove the first matching node from the list
+
+class LinkedList:
+    head = None
+    tail = None
+
+def append(Llist, thing):
+    if Llist.head==None:
+        Llist.head=Node(value=thing)
+        Llist.tail=Llist.head
+        return
+    Llist.tail.nextNode=Node(value=thing)
+    Llist.tail=Llist.tail.nextNode
+
+
+list1=LinkedList()
+append(list1, 'hi')
+append(list1, 'hi again')
+append(list1, 'why am I saying hi so many times?')
+print(list1.head.value)
+print(list1.head.nextNode.value)
+print(list1.head.nextNode.nextNode.value)
+
+
+
diff --git a/notes-and-examples/2026.01.28/main.py b/notes-and-examples/2026.01.28/main.py
new file mode 100644
index 0000000..6eef6fa
--- /dev/null
+++ b/notes-and-examples/2026.01.28/main.py
@@ -0,0 +1,51 @@
+some_numbers = [2, 5, 20, 18, 4]
+
+more_numbers = some_numbers.copy()
+
+some_numbers[2] = 100
+
+# print(more_numbers[2])  # prints 100?
+
+class Sample:
+    other_samples = []
+    value = 0
+
+samples = [Sample(), Sample(), Sample()]
+more_samples = samples.copy()  # shallow copy
+samples[1].value = 10
+samples[1].other_samples.append(samples[0])
+# print(more_samples[1].value)  # 10
+
+samples.append(Sample())
+samples[3].value = 100
+# print(more_samples[3].value)
+
+other_sample.value = 40
+# print(sample.value)
+
+class Dog:
+    def __init__(self, age, name):
+        self.age = age
+        self.name = name
+
+# dog_1 = Dog()
+
+class Node:
+    next_node = None
+
+    def __init__(self, value):
+        self.value = value
+    
+node_1 = Node(0)
+node_2 = Node(0)
+
+node_2.value = 10
+
+node_1.next_node = node_2
+
+node_2.value = 20
+
+current_node = node_1
+while (current_node != None):
+    print(current_node.value)
+    current_node = current_node.next_node
diff --git a/notes-and-examples/2026.01.28/object_array_reference_sample.py b/notes-and-examples/2026.01.28/object_array_reference_sample.py
new file mode 100644
index 0000000..e69de29
diff --git a/notes-and-examples/2026.01.28/object_reference_sample.py b/notes-and-examples/2026.01.28/object_reference_sample.py
new file mode 100644
index 0000000..824d0f4
--- /dev/null
+++ b/notes-and-examples/2026.01.28/object_reference_sample.py
@@ -0,0 +1,8 @@
+class Sample:
+    other_samples = []
+    value = 0
+
+sample = Sample()
+other_sample = sample
+sample.value = 20
+print(other_sample.value)
diff --git a/notes-and-examples/2026.02.04/main.py b/notes-and-examples/2026.02.04/main.py
new file mode 100644
index 0000000..a8ab05d
--- /dev/null
+++ b/notes-and-examples/2026.02.04/main.py
@@ -0,0 +1,13 @@
+class Node:
+    next = None
+    previous = None
+
+class Queue:
+    front = None
+    tail = None
+
+    def enqueue(self, node: Node):
+        pass
+
+    def dequeue(self):
+        pass
diff --git a/data-structures-tutoring/README.md b/notes-and-examples/README.md
similarity index 100%
rename from data-structures-tutoring/README.md
rename to notes-and-examples/README.md