question: static public BTree doInsertRandomSparseKeySequenceTest ( final BTree btree , final int ninserts , final int trace ) { final int keys [ ] = new int [ ninserts ] ; final SimpleEntry entries [ ] = new SimpleEntry [ ninserts ] ; final Random r = new Random ( ) ; int lastKey = 0 ; for ( int i = 0 ; i < ninserts ; i ++ ) { final int key = r . nextInt ( 100 ) + lastKey + 1 ; keys [ i ] = key ; entries [ i ] = new SimpleEntry ( ) ; lastKey = key ; } return doInsertRandomKeySequenceTest ( btree , keys , entries , trace ) ; }
target:  Insert a sequence of monotonically increase keys with random spacing into a tree in a random order and verify the expected entry traversal afterwards.