*Suppose that we insert the keys (**1,2,.......,n) **into an empty B-tree with minimum **degree **2. How many nodes does the final B-tree have?* explain your answer.!
-- *Avinesh Kumar, * -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
