Call Support +91-85588-96644
TCYonline

Login

Sign Up

Please enter a Username or Email ID
Please enter a password
Keep me logged in
Please enter your name
Please enter your mobile number
You can't leave Captcha Code empty
By submitting this form, you agree to the Terms & Privacy Policy.
OR

Sign Up via Facebook

Sign Up via Google

Sign Up via Twitter

Download Software
Tests given

Download TCY App

App Image

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 how to approach this question

Reply


Please type your answer before submitting.
Submit