New RBI Grade B 2025 Notification will come Soon! Enroll Here

    Question

    In B+ trees, which of the following statements is

    FALSE?
    A All data entries are stored at the leaf level. Correct Answer Incorrect Answer
    B Non-leaf nodes contain keys that guide searches Correct Answer Incorrect Answer
    C A B+ tree of order mmm has at most m−1m-1m−1 keys per node. Correct Answer Incorrect Answer
    D Leaf nodes are linked together in a doubly linked list. Correct Answer Incorrect Answer
    E The height of a B+ tree increases logarithmically with the number of records. Correct Answer Incorrect Answer

    Solution

    In a B+ tree , leaf nodes are linked together in a singly linked list to facilitate efficient range queries and sequential access. Linking them in a doubly linked list would add extra overhead without significant benefits in most database scenarios. The singly linked structure is sufficient for forward traversal, which is the primary use case in databases. Why Other Options Are Incorrect:

    • Option A: Correct. In a B+ tree, all actual data is stored at the leaf level to maintain a uniform depth and simplify search operations.
    • Option B: Correct. Non-leaf nodes serve as an index with keys, guiding searches to the correct leaf nodes.
    • Option C: Correct. A node in a B+ tree of order mmm can have at most m−1m-1m−1 keys, ensuring balanced tree properties.
    • Option E: Correct. The height of the B+ tree grows logarithmically, ensuring efficient operations even with large datasets.

    Practice Next