assertEquals( 7, btree.rootPage.findRightMost().getKey() );
assertEquals( 1, btree.rootPage.findLeftMost().getKey() );
Cursor<Integer, Integer> cursor = btree.browse();
int i = 0;
while ( cursor.hasNext() )
{
Tuple<Integer, Integer> expected = sortedTuple.get( i++ );
Tuple<Integer, Integer> actual = cursor.next();