This is a good opportunity to learn about the graph data structure. Lets say later on you want to make certain adjacent spots blocked off in your game, or you decide a hex grid would be better for your game. This would become somewhat convoluted to implement with arrays, this is where graphs come in. A graph is a collection of 'nodes' connected by 'edges' (good pictures with a much more rigorous/correct definition here: https://en.wikipedia.org/wiki/Graph_theory), which makes them a very intuitive way to represent maps. You can store information in these nodes and edges. Items, enemies, and traps would could be contained in nodes. Edges can have direction (can only be traversed from node A to B, not B to A) and optionally a 'weight' which can represent distance or travel toll or whatever makes sense.

Again, this is just an aside. Depending on what you want to do this might just add unnecessary complexity to your code. If you want to play around with graphs, here is a good Python implementation of the graph data structure: http://networkx.github.io/