Can someone explain why is it A?

It's a C++ data strucutres course

Suppose you program a game where the player must explore a maze and find the path to a treasure. To exit the maze, the player will simply follow his/her steps in reverse. The most appropriate data structure to store all the player's steps is: a) A stack. b) A queue. c) A sorted list. d) An unsorted list. e) None of the above. A dynamic array based Stack ADT is allowed not to implement: a) Assignment operator