Review of Trees - Database Systems - page 454

Figure A1-25. Direct Search Algorithm
Figure A1-26 provides the summarized form of the B-tree insertion algorithm.
This algorithm is easier described than implemented. Fortunately, you do not need to
implement it in a typical data structures course. However, you do need to be able to
demonstrate an understanding of the algorithm, so let us take an example:
Figure A1-26. Summary of B-tree Insertion Algorithm
Example 11: Referring to the B-tree of Figure A1-23 , consider inserting the following
items: 22, 41, 59, 57, 54. Figure A1-27 illustrates how these items would be added.