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?
A. Each leaf node has a pointer to the next leaf node
B. Non-leaf nodes have pointers to data records
C. B+ Tree is a height-balanced tree
D. Key values in each node are kept in sorted order
Answer:B
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?
A. Each leaf node has a pointer to the next leaf node B. Non-leaf nodes have pointers to data records C. B+ Tree is a height-balanced tree D. Key values in each node are kept in sorted order