GATE 2019
October 5, 2023Computer-Organization
October 5, 2023GATE 2019
| Question 15 |
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?
| Each leaf node has a pointer to the next leaf node | |
| Non-leaf nodes have pointers to data records | |
| B+ Tree is a height-balanced tree | |
| Key values in each node are kept in sorted order |
Question 15 Explanation:
Memory based question:
In B+ trees non-leaf nodes do not have pointers to data records.
In B+ trees non-leaf nodes do not have pointers to data records.
Correct Answer: B
Question 15 Explanation:
Memory based question:
In B+ trees non-leaf nodes do not have pointers to data records.
In B+ trees non-leaf nodes do not have pointers to data records.