Binary Trees

• medium complexity to implement (assuming you can’t get them from a library)
• inserts are O(logN)
• lookups are O(logN)

Linked lists (unsorted)

• low complexity to implement
• inserts are O(1)
• lookups are O(N)

Hash tables

• high complexity to implement
• inserts are O(1) on average
• lookups are O(1) on average

Source via: http://stackoverflow.com/questions/371136/binary-trees-vs-linked-lists-vs-hash-tables