A recursive pre-order traversal visits children from left to right. How should an equival…

A recursive pre-order traversal visits children from left to right. How should an equivalent LIFO stack push those children?

1. Right to left, so the leftmost child is popped first
2. Left to right, because push order always equals visit order
3. Any order, because depth-first traversal has no observable order