 public static void deleteDups(Node n) {     Hashtable<Integer, Boolean> table = new Hashtable<Integer, Boolean>();     Node previous = null;     while (n != null) {         if (table.containsKey(n.value)) previous.next = n.next;         else {             table.put(n.value, true);             previous = n;         }         n = n.next;          System.out.println("");         System.out.println("");         System.out.print