next up previous
Next: Case 2a Up: CSE 2320: Algorithms and Previous: Deletion: B-Tree-Delete(x, k)


There are three general cases:

[Case 1:] If key k in node x and x is a leaf, then remove k from x


[Case 2:] If k is in x and x is an internal node.

One of three subcases:

Copyright © 1998 The University of Texas at Arlington