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

Example

Note how B-Trees grow from the top, not from the bottom like BSTs or RBTs.



Copyright © 1998 The University of Texas at Arlington