Quiz: Binary Trees

In iterative inorder traversal, why do we push all left children onto the stack before processing?

1. A.It prevents stack overflow on deep trees
2. B.It's more memory efficient than processing immediately
3. C.The stack reverses the order, so pushing left gives right-first processing
4. D.Inorder visits left subtree first, so we delay processing until we've gone as far left as possible