Given any list if memory access speed is constant, a hashed search averages fastest.

Real computers do not have constant memory access time. A tree structure that preserves locality of reference can therefore be faster if the application has "hotspots".