Question

Which is a dynamic tree based indexing structure for database?

• A. ISAM
• B. B+
• C. Linear probing
• D. Extendible hashing

Hint:

B+ trees are commonly used in databases and file systems due to their dynamic and balanced nature.

Answer 1

The Correct Option is B

B+ tree is a balanced tree index structure that supports dynamic insertion and deletion.
It maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.