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.
Preferably checking the size hints at each step, lastly, this test won't catch if the loops never run, maybe it would be better to have an external counter that is checked at the end too, or just drive the loop manually, all in all, something like

```rust
let mut iter = map.iter();
for i in range(0, size)
    assert_eq!(iter.size_hint(), (size - i, Some(size - i));
    assert_eq!(iter.next(), Some(&i));
}
assert_eq!(iter.next(), None)
```