The rebalancing algorithm can be optimized for speed and to reduce number of slabs accessed/loaded.
- Check right sibling first (instead of left sibling) to see if it has enough data to lend
- Check left sibling only if (instead of always) the right sibling doesn't have enough data to lend. The benefit from borrowing from the larger sibling was maybe not worth the extra effort of accessing 2 slabs.
- Move data within the right sibling's underlying array after it lends so it has capacity for future ops
The rebalancing algorithm can be optimized for speed and to reduce number of slabs accessed/loaded.