linkedlist: middle node and clear() done

Author: Ram swaroop

src/me/ramswaroop/Main.java

@@ -102,8 +102,9 @@ public static void main(String[] args) {
                         out.println("4. Remove at index");
                         out.println("5. Remove item");
                         out.println("6. Edit item");
-                        out.println("7. Print");
-                        out.println("8. Exit module");
+                        out.println("7. Delete LinkedList");
+                        out.println("8. Print");
+                        out.println("9. Exit module");
                         k2 = Integer.parseInt(in.nextLine());
                         int item, index;
                         switch (k2) {
@@ -146,9 +147,14 @@ public static void main(String[] args) {
                                 singleLinkedList.printList();
                                 break;
                             case 7:
+                                out.println("LinkedList deleted.");
+                                singleLinkedList.clear();
                                 singleLinkedList.printList();
                                 break;
                             case 8:
+                                singleLinkedList.printList();
+                                break;
+                            case 9:
                                 continue chooseModule;
                             default:
                                 out.println("Wrong choice!");

src/me/ramswaroop/common/SingleLinkedList.java

@@ -61,7 +61,18 @@ public void addLast(E item) {
 
     @Override
     public void clear() {
-
+        // Clearing all of the links between nodes is "unnecessary", but:
+        // - helps a generational GC if the discarded nodes inhabit
+        //   more than one generation
+        // - is sure to free memory even if there is a reachable Iterator
+        for (SingleLinkedNode<E> node = head; node != null; ) {
+            SingleLinkedNode<E> next = node.next;
+            node.item = null;
+            node.next = null;
+            node = next;
+        }
+        head = null;
+        size = 0;
     }
 
     @Override

src/me/ramswaroop/linkedlists/MiddleNode.java

@@ -0,0 +1,37 @@
+package me.ramswaroop.linkedlists;
+
+import me.ramswaroop.common.SingleLinkedList;
+import me.ramswaroop.common.SingleLinkedNode;
+
+/**
+ * Created by IntelliJ IDEA.
+ *
+ * @author: ramswaroop
+ * @date: 6/18/15
+ * @time: 10:34 PM
+ */
+public class MiddleNode<E> extends SingleLinkedList<E> {
+
+    public SingleLinkedNode<E> getMiddleNode(SingleLinkedNode<E> node) {
+        SingleLinkedNode<E> slow = node;
+        SingleLinkedNode<E> fast = node;
+        while (fast != null && fast.next != null) {
+            slow = slow.next;
+            fast = fast.next.next;
+        }
+        return slow;
+    }
+
+    public static void main(String a[]) {
+        MiddleNode<Integer> linkedList = new MiddleNode<>();
+        linkedList.add(11);
+        linkedList.add(22);
+        linkedList.add(33);
+        linkedList.add(44);
+        linkedList.add(55);
+        linkedList.add(66);
+        linkedList.add(77);
+        linkedList.add(88);
+        System.out.println(linkedList.getMiddleNode(linkedList.getNode(0)).item);
+    }
+}