Vidyalelo
Data Structure · Q91

Hashing

Programming · Data Structure · question 91

Q91

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
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board