package com.arcologydesigns.DataStructures;

import org.junit.After;
import org.junit.Before;
import org.junit.Test;

import static org.junit.Assert.*;

/**
 * BSTTest created by Borislav S. on 7/24/2015 @ 7:44 PM.
 */
public class BSTTest {

   @Before
   public void setUp() throws Exception {


   }

   @After
   public void tearDown() throws Exception {

   }

   @Test
   public void testMakeEmpty() throws Exception {
      BST<Integer> testTree = new BST<>();
      testTree.insertItem(10);
      assertEquals(10, testTree.getMaxTreeValue());//bad things happened when i tried to run this.
      //This line exist to perform a push.
   }

   @Test
   public void testIsEmpty() throws Exception {

   }

   @Test
   public void testIsFull() throws Exception {

   }

   @Test
   public void testInsertItem() throws Exception {

   }

   @Test
   public void testCountNodes() throws Exception {

   }

   @Test
   public void testPreOrderTraversal() throws Exception {

   }

   @Test
   public void testInOrderTraversal() throws Exception {

   }

   @Test
   public void testPostOrderTraversal() throws Exception {

   }

   @Test
   public void testBreadthFirstSearch() throws Exception {

   }

   @Test
   public void testBalanceRecursive() throws Exception {

   }

   @Test
   public void testGetMinTreeValue() throws Exception {

   }

   @Test
   public void testGetMaxTreeValue() throws Exception {

   }
}
@@ -111,16 +111,42 @@
 .Test;%0A%0A
+import java.util.Random;%0A%0A
 import s
@@ -448,224 +448,8 @@
 n %7B%0A
-      BST%3CInteger%3E testTree = new BST%3C%3E();%0A      testTree.insertItem(10);%0A      assertEquals(10, testTree.getMaxTreeValue());//bad things happened when i tried to run this.%0A      //This line exist to perform a push.%0A
    %7D
@@ -563,32 +563,33 @@
 ws Exception %7B%0A%0A
+%0A
    %7D%0A%0A   @Test%0A 
@@ -782,157 +782,1289 @@
 on %7B
-%0A%0A   %7D%0A%0A   @Test%0A   public void testInOrderTraversal() throws Exception %7B%0A%0A   %7D%0A%0A   @Test%0A   public void testPostOrderTraversal() throws Exception %7B%0A
+ //need to physically check these are in order in a bit.%0A       BST%3CInteger%3E testTree = new BST%3C%3E();%0A       testTree.insertItem(1);%0A       testTree.insertItem(3);%0A       testTree.insertItem(5);%0A       testTree.insertItem(6);%0A       testTree.insertItem(4);%0A       testTree.insertItem(2);%0A       assertEquals(String.valueOf(%221,3,2,5,4,6,%22), testTree.preOrderTraversal());//trailing comma%0A%0A   %7D%0A%0A   @Test%0A   public void testInOrderTraversal() throws Exception %7B%0A       BST%3CInteger%3E testTree = new BST%3C%3E();%0A       testTree.insertItem(1);%0A       testTree.insertItem(3);%0A       testTree.insertItem(5);%0A       testTree.insertItem(6);%0A       testTree.insertItem(4);%0A       testTree.insertItem(2);%0A       assertEquals(String.valueOf(%221,2,3,4,5,6,%22), testTree.inOrderTraversal());//trailing comma%0A%0A   %7D%0A%0A   @Test%0A   public void testPostOrderTraversal() throws Exception %7B%0A       BST%3CInteger%3E testTree = new BST%3C%3E();%0A       testTree.insertItem(1);%0A       testTree.insertItem(3);%0A       testTree.insertItem(5);%0A       testTree.insertItem(6);%0A       testTree.insertItem(4);%0A       testTree.insertItem(2);%0A       //System.out.println(testTree.postOrderTraversal()); //useful to check traversals.%0A       assertEquals(String.valueOf(%222,4,6,5,3,1,%22), testTree.postOrderTraversal());//trailing comma
 %0A   

Order Traversals updated BST TEST