Symbol Tables & Binary Search Trees

Consider the following scenario: you are creating an algorithm that finds a path between two street intersections $($e$.$g$.,"1$st Innovation Way & Arizona Ave"$)$ and you need to keep track of each intersection you see so that you don't accidentally visit the same place twice. Would it make more sense to use an array or a symbol table for this problem? Explain.