Case 3

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