rebalanceRemove rebalances the tree after a remove operation. This can be either by rotating to the right, to the left or by merging. First, the sibling nodes are checked to see if they have enough items for rebalancing (>= minItems+1). If they don't have enough items, then merging with one of the s
(unbalancedNode *Node, unbalancedNodeIndex int)
source not stored for this graph (policy: none)
no test coverage detected