Homework on Calculating Node Sizes for B-Star Trees

Use the details in the write-up of your Programming Assignment on B-Star Trees to answer the following questions.  Write these down and turn them in at the beginning of class.  Here is the URL for the B-Star Tree Programming Assignment:

http://www.ecst.csuchico.edu/~melody/courses/Spring2006CSCI311/ProgTwo_Bstar.htm

1) For an order 13 B-Star Tree calculate

 A) The maximum size of the root node in terms of the number of data elements

 B) The maximum and minimum (i.e. 2/3 full) sizes of a non-root node

 C) The size of the three nodes that are obtained when 2 nodes split into 3 on a split.  Give in the sizes of the leftmost, middle and rightmost of the 3 nodes in left to right order.

2) For an order 29 B-Star Tree calculate

 A) The maximum size of the root node in terms of the number of data elements

 B) The maximum and minimum (i.e. 2/3 full) sizes of a non-root node

 C) The size of the three nodes that are obtained when 2 nodes split into 3 on a split.  Give in the sizes of the leftmost, middle and rightmost of the 3 nodes in left to right order.