@Test
	public void testRoot() {
		tree = new BinarySearchTree<String, String>();
		String root = null;
		String result = null;
		
		tree.add("Ram GC","DW-210");
		tree.add("Hari Shrestha","DW-211");
		tree.add("Shyam Karki","DW-2100");
		
		previousli = tree.inOrder(tree.returnRoot());
		
		for(int i=previousli.size()-1; i==previousli.size()-1; i--) {
            
			root = previousli.get(i).key;
			
		}
		
		result = tree.returnRoot().key;
		
		assertEquals(root,result);
	}