Choose the ADT that is the best auxiliary data structure used for the implementation of a non-recursive Depth-first traversal
a. Queue (containing Tree*)
b. Tree (containing chars)
c. Stack (containing chars)
d. Stack (containing Tree*)