Hash Tables on Data Structure and Algorithms related Questions and Answers


Question :   Which of the following is true for a Hash tree?
1. Hashing is used for sequential access
2. Indexing is used for direct access
3. Hash tree allows only sequential access
4. Hashing is used for direct access
Answer :   4 - Hashing is used for direct access  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter