Hi,
Given that a BTree has an order on its elements, I thought it wouldn't be too hard to get the next and previous elements (where they exist). I can't see an easy way to do this with std::collections::BTreeMap and std:: collections::BTreeSet. Am I missing something? (I may well be; I was navigating the docs on my phone.) If not, it I wrote some additions, how hard would it be to get them in the standard lib?
Thanks,
Will