Is address-list lookup speed O(n) or O(1)?

There is an address-list containing many items.
Should I sort them for increase lookup performance, or lookup is order-independent?
In another words, is address-list checked linearly, using sorted tree or using hash keys?

using tree