+1 vote
in Data Structures & Algorithms I by (88.2k points)
Sequential access in a Hash tree is faster than in B-trees.

(a) True

(b) False

My question comes from Hash Tables in chapter Hash Tables of Data Structures & Algorithms I

The question was asked in semester exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (a) True

For explanation: The sequential access in the hash tree is more efficient and faster than in B-tree. Because while constructing the hash tree in the expansions and contractions of the file is an estimated.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...