@AfterGroups("Insertion")
	@Test(groups = "Two-Three Tree")
	public void test23TreeSearch() throws KeyNotFoundException {

		Integer count;

		Reporter.log("[ ** 2-3 Tree Search ** ]\n");

		try {
			timeKeeper = System.currentTimeMillis();
			for (Integer i = 0; i < seed; i++) {
				b23Tree.search(i);
			}
			Reporter.log("Search -- Passed : "
					+ (System.currentTimeMillis() - timeKeeper) + " ms\n");

			timeKeeper = System.currentTimeMillis();
			count = 0;

			for (Integer i = -seed; i < 0; i++) {
				try {
					b23Tree.search(i);
				} catch (KeyNotFoundException e) {
					count++;
				}
			}
			if (count == seed) {
				Reporter.log("False search -- Passed : "
						+ (System.currentTimeMillis() - timeKeeper) + " ms\n");
			} else {
				throw new KeyNotFoundException();
			}
		} catch (KeyNotFoundException e) {
			Reporter.log("Searching -- Failed!!!\n");
			throw e;
		}

	}