In a B+ tree, both the internal nodes and the leaves have keys.

Category: QuestionsIn a B+ tree, both the internal nodes and the leaves have keys.
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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.