next up previous
Next: Case 3a Up: CSE 2320: Algorithms and Previous: Case 2c

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

Copyright © 1998 The University of Texas at Arlington