// and confirm that the tree was split
assertTrue(validator.tree.size() > 1);
// add a row
Token mid = partitioner.midpoint(range.left, range.right);
validator.add(new CompactedRowStub(new BufferDecoratedKey(mid, ByteBufferUtil.bytes("inconceivable!"))));
validator.complete();
// confirm that the tree was validated
Token min = validator.tree.partitioner().getMinimumToken();
assertNotNull(validator.tree.hash(new Range<>(min, min)));