Q27
How does a B-Tree differ from a Binary Search Tree (BST)?
A.
B-Trees have no constraints on height.
B.
B-Trees allow multiple children per node.
AnswerC.
BSTs can store more keys per node.
D.
B-Trees have no constraints on height.
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board