hash tables vs binary tree

Hi,

I sorta get how a binary tree works with the root node and how its ordered.

However im confused of a hash table. Whats it do, and is it more efficient to use then a binary tree?

Could someone help explain please if possible which is better and how hash sets work

Thanks

You are in effect asking for someone to write a tutorial on how hashing works. Better for you to first read a tutorial that's already been written and then come back if you still have questions. For e.g.,

Hash table - Wikipedia, the free encyclopedia
The Map Interface (The Java™ Tutorials > Collections > Interfaces)
Java theory and practice: Hashing it out
Hash function - Wikipedia, the free encyclopedia
HashMap, Java HashMap Tutorial | Java Tutorials and Examples