1.

Sequential access in a Hash tree is faster than in B-trees.

A. True
B. False
Answer» B. False


Discussion

No Comment Found