+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following is true for a Hash tree?

(a) Hashing is used for sequential access

(b) Indexing is used for direct access

(c) Hash tree allows only sequential access

(d) Hashing is used for direct access

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

This question was addressed to me by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct option is (d) Hashing is used for direct access

Easiest explanation - Hash tree allows direct as well as sequential access of the records. Hashing is used for direct access and indexing is generally used for the sequential access.

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.