Experiment/evaluate batch construction

[mkirchner]

"You're also missing a batch construction call, create a new tree out of N key/value pairs. That's much faster than inserting one at a time because you can sort the array up front and then create the tree without any temporary nodes."

Not sure if this is feasible since the sorting is defined by the hash function...