Multiple Choice
What type of tree is best used for indexing external data?
A) B-tree
B) binary search tree
C) 2-3-4 tree
D) AVL tree
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: External mergesort begins by merging sorted runs.
Q3: In a B-tree,the key values at each
Q4: Let N be a node in a
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