code: func (tree *btree) Insert(keys ...Key) {
  	for _, key := range keys {
  		tree.insert(key)
  	}
  }
docs: // Insert will insert the provided keys into the btree.  This is an
  // O(m*log n) operation where m is the number of keys to be inserted
  // and n is the number of items in the tree.