complete btree rewrite

Replaces BTree with BTreeMap and BTreeSet, which are completely new implementations.
BTreeMap's internal Node representation is particularly inefficient at the moment to
make this first implementation easy to reason about and fairly safe. Both collections
are also currently missing some of the tooling specific to sorted collections, which
is planned as future work pending reform of these APIs. General implementation issues
are discussed with TODOs internally

[breaking-change]

Still waiting on compilation/test/bench stuff locally, but the edit-distance on any errors should be very small at this point. This is ready to be reviewed.
Still need a macro to determine which iterator to retrieve from the Node. Unless... hmm, I could maybe hack something together using a trait. Like:

```
pub trait Traverse<N> {
    traverse(node: N) -> Self;
}
```

with e.g.

```
impl<'a> Traverse<&'a Node<K, V>> for Traversal<'a, K, V> {
   fn traverse(node: &'a Node<K, V>) -> Traversal<'a, K, V>{
     node.iter()
  }
}
```

and calling code just does `traverse(node)`, which should Do The Right Thing via inference.