Q67
Sequential access in a Hash tree is faster than in B-trees.
A.
True
AnswerB.
False
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board