title: When you split a node from a B-Tree and it's of an odd order, how do you evenly distribute the keys?
body: <p>When you split a node that is of order 5, then you would have 4 keys, so you would be able to distribute evenly, but when the node has an odd number of keys then things dont distribute so evenly. Any help with this?</p>