Binary Tree Priority Queue

starting to implement

Author: codelogicws

out/production/Algorithms/ws/codelogic/algorithms/priorityqueue/BinaryTree.class

@@ -0,0 +1,22 @@
+package ws.codelogic.algorithms.priorityqueue;
+
+public class BinaryTree <T>{
+
+    private T[] elements;
+    private int currentElement;
+
+    public BinaryTree(T[] emptyArray){
+        elements = emptyArray;
+        currentElement = -1;
+    }
+
+    public void add(T element){
+        elements[++currentElement] = element;
+    }
+
+    public T remove(){
+        return elements[currentElement--];
+    }
+
+
+}

out/production/Algorithms/ws/codelogic/algorithms/priorityqueue/PriorityQueueTest.class

@@ -0,0 +1,38 @@
+package ws.codelogic.algorithms.priorityqueue;
+
+import org.junit.Before;
+import org.junit.Test;
+import static org.junit.Assert.*;
+
+public class PriorityQueueTest {
+
+    private BinaryTree<Integer> queue;
+
+    @Before
+    public void setUp() {
+        Integer[] array = new Integer[5];
+        queue = new BinaryTree<Integer>(array);
+    }
+
+    @Test
+    public void adding1ObjectYeildsThatObject() {
+        queue.add(9);
+        checkNumber(9);
+    }
+
+    private void checkNumber(Integer numberToTest){
+        Integer numberFromQueue = queue.remove();
+        assertEquals(numberFromQueue, numberToTest);
+    }
+
+    @Test
+    public void adding3ObjectYeildsThoseObjectsInOrder() {
+        queue.add(5);
+        queue.add(1);
+        queue.add(9);
+        checkNumber(9);
+        checkNumber(5);
+        checkNumber(1);
+    }
+
+}

out/production/Algorithms/ws/codelogic/test/TestSuite.class

@@ -5,6 +5,7 @@
 import ws.codelogic.algorithms.Stack.ArrayStackTest;
 import ws.codelogic.algorithms.Stack.LinkStackTest;
 import ws.codelogic.algorithms.arithmetic.evaluation.DijkstrasTwoStackTest;
+import ws.codelogic.algorithms.priorityqueue.PriorityQueueTest;
 import ws.codelogic.algorithms.search.SearchTest;
 import ws.codelogic.algorithms.selection.QuickSelectTest;
 import ws.codelogic.algorithms.shuffle.ShufflerTest;
@@ -14,6 +15,7 @@
 
 @RunWith(Suite.class)
 @Suite.SuiteClasses({
+        PriorityQueueTest.class,
         Dijkstras3WayPartitionTest.class,
         QuickSelectTest.class,
         QuickSortTest.class,