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

(a) Compared to B-tree, B+ -tree has larger fanout

(b) Deletion in B-tree is more complicated than in B+ -tree

(c) B+ -tree has greater depth than corresponding B-tree

(d) Both B-tree and B+ -tree have same search and insertion efficiencies

I want to ask this question from B-Trees topic in section B-Trees of Data Structures & Algorithms I

I got this question during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct answer is (c) B+ -tree has greater depth than corresponding B-tree

For explanation: A B+ -tree has larger fanout and therefore have a depth smaller than that of corresponding B-tree.

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

...