} else { BTreeNode<Key, Value> lp = getLeftPeer(tx, this); if( lp!=null ) { previousLeaf = lp.getRightLeaf(tx);
} else { BTreeNode<Key, Value> lp = getLeftPeer(tx, this); if( lp!=null ) { previousLeaf = lp.getRightLeaf(tx);
} else { BTreeNode<Key, Value> lp = getLeftPeer(tx, this); if( lp!=null ) { previousLeaf = lp.getRightLeaf(tx);
} else { BTreeNode<Key, Value> lp = getLeftPeer(tx, this); if( lp!=null ) { previousLeaf = lp.getRightLeaf(tx);