From 97c2ab52c47d38160d7608aa7c6984c72a53b6d5 Mon Sep 17 00:00:00 2001
From: a <@>
Date: Mon, 18 Dec 2023 17:11:10 +0100
Subject: [PATCH] Julian der Hater

---
 List.java  | 21 +++++++++++++++++++++
 Queue.java | 50 ++++++++++++++++++++++++++++++++++++++++++++++++++
 Test.java  |  6 ++++++
 3 files changed, 77 insertions(+)
 create mode 100644 Queue.java
 create mode 100644 Test.java

diff --git a/List.java b/List.java
index ac48552..ff77cd6 100644
--- a/List.java
+++ b/List.java
@@ -76,6 +76,27 @@ public class List<T>
     }
     public T remove(int n)
     {
+        Node<T> current = first;
         
+        for(int i = 0;i < n-1; i++)
+        {
+            current = current.next;
+        }
+        
+        T tmp = current.next.wert;
+        current.next = current.next.next;
+        return tmp;
+    } 
+    public String toString()
+    {
+        String result = "";
+        Node<T> current = first;
+        while ( current != null)
+        {
+            result += current.wert;
+            current = current.next;
+        }
+        
+        return result;
     }
 }
diff --git a/Queue.java b/Queue.java
new file mode 100644
index 0000000..7fb0fb8
--- /dev/null
+++ b/Queue.java
@@ -0,0 +1,50 @@
+public class Queue<T>
+{
+    private Node<T> first;
+    
+    public Queue() {
+        first = null;
+    }
+    
+    public boolean isEmpty() {
+        if (first == null) return true;
+        return false;
+    }
+    
+    public T front() {
+        if (first == null) return null;
+        return first.wert;
+    }
+    
+    public void enqueue(T val) {
+        Node<T> neu = new Node<T>();
+        neu.wert = val;
+        
+        if (first == null) {
+            first = neu;
+        } else {
+            Node<T> current = first;
+            while (current.next != null) {
+                current = current.next;
+            }
+            current.next = neu;
+        }
+    }
+    
+    public T dequeue() {
+        T tmp = first.wert;
+        first = first.next;
+        return tmp;
+    }
+    
+    public String toString() {
+        String result = "";
+        Node<T> current = first;
+        while (current != null) {
+            result += current.wert + ", ";
+            current = current.next;
+        }
+        
+        return result;
+    }
+}
diff --git a/Test.java b/Test.java
new file mode 100644
index 0000000..37ed451
--- /dev/null
+++ b/Test.java
@@ -0,0 +1,6 @@
+import java.util.ArrayList;
+
+public class Test
+{
+    
+}