Multiple Choice
Let N be a node in a B-tree.If N has m subtrees S0,S1,S2,…,Sm-1,and N's key values are K1,K2,K3,…,Km-1,then which of the following statements is true?
A) All values in subtree S0 are greater than K1.
B) All values in subtree S1 are less than K1.
C) All values in subtree Sm-2 are greater than Km-2.
D) All values in subtree Sm-1 are less than Km-1.
Correct Answer:

Verified
Correct Answer:
Verified
Q1: External mergesort begins by merging sorted runs.
Q2: What type of tree is best used
Q3: In a B-tree,the key values at each
Q5: A 2-3 tree is a type of
Q6: What is the maximum number of nodes
Q7: Inserting a single key value into a
Q8: Why is random access preferable over sequential
Q9: In the external version of mergesort,if we
Q10: In a binary search tree,if a node
Q11: If a B-tree of order 5 contains