This function is based on the similar function prototype that is given by CLRS for B-Tree but is altered (quite a bit) to be able to be used for B+ Trees. The main difference is that when the split happens all keys are preserved and the first key of the right node is moved up. For example say we h
(TreeInternalNode n, int index)
source not stored for this graph (policy: none)
no test coverage detected