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?

  1.  B+ Tree is a height-balanced tree
  2.  Non-leaf nodes have pointers to data records
  3.  Key values in each node are kept in sorted order
  4.  Each leaf node has a pointer to the next leaf node
Asked question