+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is true?

(a) B + tree allows only the rapid random access

(b) B + tree allows only the rapid sequential access

(c) B + tree allows rapid random access as well as rapid sequential access

(d) B + tree allows rapid random access and slower sequential access

Question is from B-Trees in chapter B-Trees of Data Structures & Algorithms I

The question was posed to me during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right answer is (c) B + tree allows rapid random access as well as rapid sequential access

Easiest explanation - The B+ -tree being a variation of B-tree allows rapid random access. In a B+ -tree the leaves are linked together, so it also provides rapid sequential access.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...