Status: IN
In iterative preorder traversal, the right child is pushed onto the stack before the left child so that LIFO ordering produces the correct root-left-right visit sequence.
Source: entries/2026/06/06/binary-tree-preorder-traversal-solution.md