Sorted dict 1

Pull request for SortedDict and BalancedTree23 taking into account Kevin Squire's feedback from the past 12 days.
This is a monster of a loop!  Consider creating separate, small, helper functions for
* splitting a 3 node
* adding a new 2 node
* `push_or_reuse!`, as mentioned below

Or whatever might make most sense.