    @Test
    public void testFind() throws Exception {

        for (int n = 0; n < 10; n++) {
            for (int i = 0; i < inserted.length; i++) {
                assertTrue(tree.find(inserted[i]));
            }
        }
        for (int i = 0; i < 1000; i++) {
        	assertFalse(tree.find(rand.nextInt(inserted.length) + inserted.length + 1));
        }
    }