+1 vote
in Data Structures & Algorithms I by (110k points)
Which one of the following data structures are preferred in database-system implementation?

(a) AVL tree

(b) B-tree

(c) B+ -tree

(d) Splay tree

I would like to ask this question from B-Trees topic in chapter B-Trees of Data Structures & Algorithms I

I had been asked this question during an interview for a job.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (c) B+ -tree

The best explanation: The database-system implementations use B+ -tree data structure because they can be used for multilevel indexing.

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.