package tests;

import static org.junit.Assert.assertEquals;
import static org.junit.Assert.fail;

import java.util.NoSuchElementException;

import org.junit.Test;

import junit.framework.TestCase;
import tree.PlaceKeysValuesInArrayLists;
import tree.PolymorphicBST;

public class StudentTests extends TestCase {
	@Test
	public void testAddKeysToCollection() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "8");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		System.out.println("BKAEDHA");
		System.out.println(ptree.subMap(8, 13).keySet());
		System.out.println(ptree.keySet());
		System.out.println("BKAEDHA");

	}

	@Test
	public void testDelete() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "8");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		ptree.remove(4);
		ptree.remove(3);
		ptree.remove(10);
		ptree.remove(14);
		ptree.remove(13);
		ptree.remove(1);
		PolymorphicBST<Integer, String> ptree2 = new PolymorphicBST<Integer, String>();
		ptree2.put(3, "1");

		System.out.println(ptree.keySet());
	}

	@Test
	public void testHeight() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "8");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		assertEquals(4, ptree.height());
	}

	@Test
	public void testInOrderTraversal() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "8");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(1, "5");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		System.out.println("IN ORDER");
		PlaceKeysValuesInArrayLists<Integer, String> task = new PlaceKeysValuesInArrayLists<Integer, String>();
		ptree.inorderTraversal(task);
		System.out.println(task.getKeys());
	}

	@Test
	public void testInsert() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "8");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		assertEquals(9, ptree.size());

	}

	@Test
	public void testMax() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "8");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		assertTrue(ptree.getMax().equals(14));
	}

	@Test
	public void testMin() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "8");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		assertTrue(ptree.getMin().equals(1));
		for (int i = 0; i < 15; i++) {
			ptree.remove(i);
		}
		assertEquals(0, ptree.size());
	}

	@Test
	public void testRightRootLeftTraversal() {

	}

	@Test
	public void testSearch() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "WHATS UP");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		assertEquals("WHATS UP", ptree.get(8));
	}

	@Test
	public void testSize() {

	}

	@Test
	public void testSubTree() {
		PolymorphicBST<Integer, String> ptree = new PolymorphicBST<Integer, String>();
		ptree.put(8, "8");
		ptree.put(3, "3");
		ptree.put(10, "10");
		ptree.put(14, "14");
		ptree.put(13, "13");
		ptree.put(1, "1");
		ptree.put(6, "6");
		ptree.put(4, "4");
		ptree.put(7, "7");
		System.out.println(ptree.subMap(8, 13).keySet());
	}

}