Currently, b tree only does find, insert and (eventually) delete. An optimization to reduce split/merge is key rotation.
Currently, b tree only does find, insert and (eventually) delete. An optimization to reduce split/merge is key rotation.