In B+ trees, which of the following statements is

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.