{"id":"preorder-right-before-left-push-order","text":"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.","truth_value":"IN","source":"entries/2026/06/06/binary-tree-preorder-traversal-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"preorder-right-before-left-push-order","truth_value":"IN","reason":"premise"}]}}