next up previous
Next: Case 3b Up: CSE 2320: Algorithms and Previous: Case 3

Case 3a

If childi(x) has t-1 keys but has a left or right sibling with $\geq$ t keys, then borrow one from sibling

$\;\;\;\;\;$move key from x to childi(x)
$\;\;\;\;\;$move key from sibling to x
$\;\;\;\;\;$move child from sibling to childi(x)


Copyright © 1998 The University of Texas at Arlington