📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    Which data structure is commonly used for implementing

    database indexes like B-trees and B+ trees, known for their efficiency in disk-based storage?
    A Linked List Correct Answer Incorrect Answer
    B Hash Table Correct Answer Incorrect Answer
    C Tree (specifically balanced trees) Correct Answer Incorrect Answer
    D Array Correct Answer Incorrect Answer
    E Stack Correct Answer Incorrect Answer

    Solution

    B-trees and B+ trees are types of balanced tree data structures specifically designed for efficient disk I/O, making them ideal for database indexing.

    Practice Next
    ask-question