Data Structures Trees Question:
Explain a B+ tree?
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.
| Previous Question | Next Question |
| What is threaded binary trees? | Explain ree database. Explain its common uses? |