0 votes 0 votes 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 explain..... Databases databases b-tree + – dhingrak asked Nov 24, 2014 • recategorized Jul 6, 2022 by Lakshman Bhaiya dhingrak 3.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply balvinders commented Jun 3, 2017 reply Follow Share i dont know the answer. VMOU Time Table 2017-18 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes http://www.cs.ucla.edu/classes/fall04/cs143/solutions/chap12a.pdf Keith Kr answered Dec 14, 2014 • selected Jan 25, 2015 by Keith Kr Keith Kr comment Share Follow See 1 comment See all 1 1 comment reply saliniverma commented Jun 14, 2017 reply Follow Share Rajasthan Police Constable Syllabus 2017 0 votes 0 votes Please log in or register to add a comment.