Breaks into packages

src/main/java/net/abhinavsarkar/algorist/hash/ChainingHashTable.java

@@ -1,6 +1,7 @@
-package net.abhinavsarkar.algorist;
+package net.abhinavsarkar.algorist.hash;
 
 import java.util.Optional;
+import net.abhinavsarkar.algorist.LinkedList;
 
 public class ChainingHashTable<K, V>
 {

src/main/java/net/abhinavsarkar/algorist/hash/LRUCache.java

@@ -1,4 +1,4 @@
-package net.abhinavsarkar.algorist;
+package net.abhinavsarkar.algorist.hash;
 
 import java.util.Iterator;
 import java.util.Optional;

src/main/java/net/abhinavsarkar/algorist/hash/LRWCache.java

@@ -1,7 +1,8 @@
-package net.abhinavsarkar.algorist;
+package net.abhinavsarkar.algorist.hash;
 
 import java.util.Iterator;
 import java.util.Optional;
+import net.abhinavsarkar.algorist.Map;
 
 public class LRWCache<K, V> implements Iterable<K>
 {

src/main/java/net/abhinavsarkar/algorist/hash/OpenAddressingHashTable.java

@@ -1,8 +1,9 @@
-package net.abhinavsarkar.algorist;
+package net.abhinavsarkar.algorist.hash;
 
 import java.util.Iterator;
 import java.util.NoSuchElementException;
 import java.util.Optional;
+import net.abhinavsarkar.algorist.Map;
 
 public class OpenAddressingHashTable<K, V> implements Map<K, V>
 {

src/main/java/net/abhinavsarkar/algorist/tree/AVLTree.java

@@ -1,10 +1,11 @@
-package net.abhinavsarkar.algorist;
+package net.abhinavsarkar.algorist.tree;
 
 import java.io.IOException;
 import java.util.Iterator;
 import java.util.NoSuchElementException;
 import java.util.Optional;
 import java.util.Stack;
+import net.abhinavsarkar.algorist.SortedMap;
 
 public class AVLTree<K extends Comparable<K>,V> implements SortedMap<K, V>
 {

src/main/java/net/abhinavsarkar/algorist/tree/BinarySearchTree.java

@@ -1,10 +1,11 @@
-package net.abhinavsarkar.algorist;
+package net.abhinavsarkar.algorist.tree;
 
 import java.io.IOException;
 import java.util.Iterator;
 import java.util.NoSuchElementException;
 import java.util.Optional;
 import java.util.Stack;
+import net.abhinavsarkar.algorist.SortedMap;
 
 public class BinarySearchTree<K extends Comparable<K>,V> implements SortedMap<K,V>
 {

src/main/java/net/abhinavsarkar/algorist/tree/TreeGraphvizVisitor.java

@@ -1,4 +1,4 @@
-package net.abhinavsarkar.algorist;
+package net.abhinavsarkar.algorist.tree;
 
 import guru.nidi.graphviz.engine.Format;
 import guru.nidi.graphviz.engine.Graphviz;

src/main/java/net/abhinavsarkar/algorist/tree/Trie.java

@@ -1,4 +1,4 @@
-package net.abhinavsarkar.algorist;
+package net.abhinavsarkar.algorist.tree;
 
 import java.io.IOException;
 import java.nio.file.Files;
@@ -9,6 +9,7 @@ import java.util.Objects;
 import java.util.Optional;
 import java.util.function.Function;
 import java.util.stream.Stream;
+import net.abhinavsarkar.algorist.SortedMap;
 
 public class Trie<K extends Comparable<K>, V> implements SortedMap<K, V>
 {