Binary search trees store entries in order, so adding the extra methods should not be hard.