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

Case 3b

if childi(x) and its left and right siblings have t-1 keys
then merge child
i(x) with one sibling using median key from x



\psfig{figure=figures/f11-10.ps}



Copyright © 1998 The University of Texas at Arlington