Julian der Hater

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;
     }
 }

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;
+    }
+}

Test.java

@@ -0,0 +1,6 @@
+import java.util.ArrayList;
+
+public class Test
+{
+    
+}