1 Answers
Option 2 : Non-leaf nodes have pointers to data records
Properties of B+ trees:
- B+ tree is height balance tree.
- Non leaf node has pointer to a node (leaf or non-leaf) and not pointer to data record
- Key value in each node is in sorted order.
- Leaf node has pointer to next leaf node.
Structure of non-leaf(internal) node of B+ tree:
Structure of leaf of B+ tree:
Option 2 is not correct.
4 views
Answered