A B-tree of order m has maximum of _____ children
Tap an option to check yourself.
Answer: A) m
By definition, a B-tree of order m has at most m children per node. Each node can therefore hold at most m-1 keys.
Source: Scan #40 page 6 Q89
By definition, a B-tree of order m has at most m children per node. Each node can therefore hold at most m-1 keys.
Source: Scan #40 page 6 Q89