Incorrect solution for 18.1-3 #546
Description
In question 18.1-3: Show all legal B-trees of minimum degree 2 that represent {1,2,3,4,5}.
Minimum keys a node can have would be: t-1 = 1
Maximum keys a node can have would be: 2t - 1 = 3
But one of the solutions is {1,2,3,4,5} is wrong, and I think there are more trees possible, not just 2.