1.

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


Discussion

No Comment Found