This issue of BTP/Branches contains all the B-TREE-P source code and documentation necessary for you to use B-trees in conjunction with your own specific application software. The best way to learn and understand how B-TREE-P works, and how it can be adapted for your particular files, is to try each of the examples presented, and to carefully read all of the explanations accompanying the source code. Read and follow BTP/Branches from beginning to end, in the presented order, without skipping any material. It won't take long, and you'll be glad you did.
All the major functions of B-TREE-P will be demonstrated. You will begin with a typical Pick data file and a typical data entry program that in no way use B-trees. You will create a new, empty data file for holding three different B-trees that will allow your name and address data to be browsed three different ways. You will use a small utility program to scan every item in your existing name and address file and create the initial version of the three B-trees. You will then use a browser program to display your names and addresses in a variety of formats. Then you'll make some minor adjustments to the original data entry program so that it will continue to adjust the B-trees whenever a name and address item is created, changed, or deleted, so that the browser display will always be up to date. Finally, you'll list all of the names and addresses in any B-tree order, without waiting for a sort.