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.