Database-Management-System
August 29, 2024ER-Model
August 29, 2024Database-Management-System
|
Question 558
|
For any B-tree of minimum degree t ≥ 2, every node other than the root must have at least ________ keys and every node can have at most ________ keys.
|
t – 1, 2t + 1
|
|
|
t + 1, 2t + 1
|
|
|
t – 1, 2t – 1
|
|
|
t + 1, 2t – 1
|
Question 558 Explanation:
For any B-tree of minimum degree t ≥ 2, every node other than the root must have at least t-1 keys and every node can have at most 2t-1 keys.
Correct Answer: C
Question 558 Explanation:
For any B-tree of minimum degree t ≥ 2, every node other than the root must have at least t-1 keys and every node can have at most 2t-1 keys.