Data Structures and Algorithms - Old Questions

1.

ix) Which of the following is true for B-Tree of order M?

a) Leaf nodes should be at different level

b) All the key values within a node must be in descending order

c) Every node has at least M children

d) All non-leaf nodes with M-1 keys must have M number of children

(d)