B+ Trees

Enter Name of Correspondence Set, Page Number, Question Number, Your Name and Roll Number for Query!

Moderator: CS Moderators Team

B+ Trees

Postby dhingrak » Sun Nov 23, 2014 1:33 am

Construct a B+tree for the following set of key values:
(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)
Assume that the tree is initially empty and values are added in ascending order. What will be
the root of the constructed B+ tree if the number of pointers that will fit in one node is six?
(A) 7, 11 (B) 7, 19 (C) 19 (D) 11

Ans is B)....

Please provide some hint for solving this question
Posts: 4
Joined: Tue Sep 23, 2014 2:08 pm
My College/Company:: Manav Rachna College
Roll Number: 19520066

Return to CS Question

Who is online

Users browsing this forum: No registered users and 1 guest