If a node N in a search tree is to have m children, how many key values must the node contain?
a. m – 1
b. m + 1
c. 2m – 1
d. log2 (n - 1)
a. m – 1
Computer Science & Information Technology
a. m – 1
b. m + 1
c. 2m – 1
d. log2 (n - 1)
a. m – 1