Results 1 to 2 of 2
Thread: hash tables vs binary tree
- 12-16-2010, 11:17 PM #1
Member
- Join Date
- Mar 2009
- Posts
- 45
- Rep Power
- 0
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
Similar Threads
-
Java Hash Tables
By Growler in forum New To JavaReplies: 1Last Post: 10-31-2010, 06:50 AM -
binary tree
By ryamz in forum New To JavaReplies: 2Last Post: 08-12-2010, 03:45 AM -
How to make a tree with tables
By Apos in forum Advanced JavaReplies: 1Last Post: 08-02-2010, 02:38 AM -
Data Structures(Binary Search Tree to AVL Tree)ASAP pls
By jfAdik in forum Forum LobbyReplies: 0Last Post: 04-04-2010, 08:40 AM -
Question about hash tables
By behrk2 in forum New To JavaReplies: 2Last Post: 07-08-2008, 05:40 PM
Bookmarks