Definition
A B+ tree of order M is a tree with the following structural properties:
(1) The root is either a leaf or has between 2 and M children.
(2) All nonleaf nodes (except the root) have between $\lceil M/2 \rceil$ and M children.
(3) All leaves are at the same depth.
Assume each nonroot leaf also has between $\lceil M/2 \rceil$ and M children
Exercise
Insert 3, 1, 4, 5, 9, 2, 6, 8, 7, 0 into an initially empty 2-3 tree (with splitting). Which one of the following statements is FALSE? (2分)
A
A. 7 and 8 are in the same node
B. the parent of the node containing 5 has 3 children
C. the first key stored in the root is 6
D. there are 5 leaf nodes
References
https://www.cnblogs.com/nullzx/p/8729425.html
https://blog.csdn.net/Woolseyyy/article/details/51557672?utm_source=blogxgwz2