Moved the interfaces into their own package

Author: Justin Wetherell

src/com/jwetherell/algorithms/data_structures/BTree.java

@@ -5,6 +5,8 @@
 import java.util.Comparator;
 import java.util.Deque;
 
+import com.jwetherell.algorithms.data_structures.interfaces.ITree;
+
 /**
  * B-tree is a tree data structure that keeps data sorted and allows searches,
  * sequential access, insertions, and deletions in logarithmic time. The B-tree

src/com/jwetherell/algorithms/data_structures/BinaryHeap.java

@@ -6,6 +6,8 @@
 import java.util.Deque;
 import java.util.List;
 
+import com.jwetherell.algorithms.data_structures.interfaces.IHeap;
+
 /**
  * A binary heap is a heap data structure created using a binary tree. It can be
  * seen as a binary tree with two additional constraints: 1) The shape property:

src/com/jwetherell/algorithms/data_structures/BinarySearchTree.java

@@ -9,6 +9,8 @@
 import java.util.Queue;
 import java.util.Set;
 
+import com.jwetherell.algorithms.data_structures.interfaces.ITree;
+
 /**
  * A binary search tree (BST), which may sometimes also be called an ordered or
  * sorted binary tree, is a node-based binary tree data structure which has the

src/com/jwetherell/algorithms/data_structures/HashArrayMappedTrie.java

@@ -4,6 +4,8 @@
 import java.util.List;
 import java.util.Map;
 
+import com.jwetherell.algorithms.data_structures.interfaces.IMap;
+
 /**
  * A hash array mapped trie (HAMT) is an implementation of an associative 
  * array that combines the characteristics of a hash table and an array mapped 

src/com/jwetherell/algorithms/data_structures/HashMap.java

@@ -3,6 +3,8 @@
 import java.util.LinkedList;
 import java.util.List;
 
+import com.jwetherell.algorithms.data_structures.interfaces.IMap;
+
 /**
  * Hash Map backed by an array of ArrayLists. hash map is a data structure that
  * uses a hash function to map identifying values, known as keys, to their

src/com/jwetherell/algorithms/data_structures/List.java

@@ -2,6 +2,8 @@
 
 import java.util.Arrays;
 
+import com.jwetherell.algorithms.data_structures.interfaces.IList;
+
 @SuppressWarnings("unchecked")
 public interface List<T> extends IList<T> {
 

src/com/jwetherell/algorithms/data_structures/PatriciaTrie.java

@@ -2,6 +2,8 @@
 
 import java.util.Arrays;
 
+import com.jwetherell.algorithms.data_structures.interfaces.ITree;
+
 /**
  * A Patricia trie (radix tree) is a space-optimized trie data structure where each
  * non-terminating (black) node with only one child is merged with its child.

src/com/jwetherell/algorithms/data_structures/Queue.java

@@ -1,5 +1,7 @@
 package com.jwetherell.algorithms.data_structures;
 
+import com.jwetherell.algorithms.data_structures.interfaces.IQueue;
+
 @SuppressWarnings("unchecked")
 public interface Queue<T> extends IQueue<T> {
 

src/com/jwetherell/algorithms/data_structures/RadixTrie.java

@@ -1,5 +1,7 @@
 package com.jwetherell.algorithms.data_structures;
 
+import com.jwetherell.algorithms.data_structures.interfaces.IMap;
+
 /**
  * A radix trie or radix tree is a space-optimized trie data structure where
  * each node with only one child is merged with its child. The result is that

src/com/jwetherell/algorithms/data_structures/SkipList.java

@@ -2,6 +2,8 @@
 
 import java.util.Random;
 
+import com.jwetherell.algorithms.data_structures.interfaces.ISet;
+
 /**
  * Skip List. A skip list is a data structure for storing a sorted list of items
  * using a hierarchy of linked lists that connect increasingly sparse