How would you decide between using a hash map and a balanced binary search tree (like a Red-Black tree) for a lookup-heavy problem?