lns[i] = new LN((byte[]) null);
TestUtils.generateRandomAlphaBytes(key);
insertAndRetrieve(cursor, key, lns[i]);
}
assertTrue(countAndValidateKeys(tree) == N_KEYS);
txn.operationEnd();
}
/**
* Create a tree. After creation, walk the bins backwards using getPrevBin
* counting the keys and validating that the keys are being returned in