Data Structures Trees Question:

Explain a B+ tree?

Tweet Share WhatsApp

Answer:

It is a dynamic, multilevel index, with maximum and minimum bounds on the number of keys in each index segment. all records are stored at the lowest level of the tree; only keys are stored in interior blocks.

Download Data Structures Trees PDF Read All 14 Data Structures Trees Questions
Previous QuestionNext Question
What is threaded binary trees?Explain ree database. Explain its common uses?