+1 vote
in Data Structures & Algorithms I by (110k points)
In a B+ tree, both the internal nodes and the leaves have keys.

(a) True

(b) False

Question is taken from B-Trees topic in section B-Trees of Data Structures & Algorithms I

The question was posed to me in final exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct answer is (b) False

The explanation is: In a B+ -tree, only the leaves have keys, and these keys are replicated in non-leaf nodes for defining the path for locating individual records.

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

...