Store subtree sizes in each node so that we can perform a quick count-in-range given 2 iterators.
Implement size(iterator, iterator), which efficiently reports the number of elements between 2 iterators [first, last) in O(log n) time. Also bug fixes to the subtree-size computation code.