How to prove or explain that B-tree cannot have degree equal to 1 and is a special case of a binary tree?

This:
The maximum number of keys in node = 2*T-1
The minimum number of keys in node = T-1
This shows clearly that even with a degree equal to 1.
The tree has the minimum number of keys is equal to 0.
And max is 2*1-1 = 1.
You can't call it a special case of the binary tree
June 5th 19 at 21:41

Find more questions by tags AlgorithmsData structuresHierarchical structures