# Answer to Question #52139 in C++ for amanda

Question #52139

4.1.1. Delete 7 from the B-tree of order 5 of Figure 6 - 1. Show the resulting tree.

4.1.2. Delete 40 from the B-tree of order 5 of Figure 6 - 1. Show the resulting tree.

4.1.3. Delete 88 from the B-tree of order 5 of Figure 6 - 1. Show the resulting tree.

4.1.4. Delete 12 from the B-tree of order 5 of Figure 6 - 1. Show the resulting tree.

4.2. Write the definition of the function insertBTree to recursively insert a record into a B-tree. Also write a program to test various operations on a B-tree.

4.1.2. Delete 40 from the B-tree of order 5 of Figure 6 - 1. Show the resulting tree.

4.1.3. Delete 88 from the B-tree of order 5 of Figure 6 - 1. Show the resulting tree.

4.1.4. Delete 12 from the B-tree of order 5 of Figure 6 - 1. Show the resulting tree.

4.2. Write the definition of the function insertBTree to recursively insert a record into a B-tree. Also write a program to test various operations on a B-tree.

Expert's answer

## Comments

## Leave a comment