next up previous
Next: Up: Previous:

Case 3

if k not in internal node x
then determine subtree child
i(x) containing k
$\;\;\;\;\;$if childi(x) has $\geq$ t keys
$\;\;\;\;\;$then B-Tree-Delete(childi(x), k)
$\;\;\;\;\;$else execute Case 3a or 3b until can descend to node having $\geq$ t keys


next up previous
Next: Up: Previous: