Answer Happy
Accurate answers. Every time.
https://answerhappy.com/
Sequential access in a Hash tree is faster than in B-trees.
https://answerhappy.com/viewtopic.php?t=736856
Page
1
of
1
Sequential access in a Hash tree is faster than in B-trees.
Posted:
Wed Jul 13, 2022 7:43 pm
by
answerhappygod
a) True
b) False