{"id":"two-stack-queue-push-always-o1","text":"`push` always appends to `_in_stack` and never triggers a transfer, making it worst-case O(1) — not just amortized — unlike `pop` and `peek` which may trigger O(n) transfers.","truth_value":"IN","source":"entries/2026/06/06/implement-queue-using-stacks-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["two-stack-queue-amortized-via-lazy-transfer"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"two-stack-queue-push-always-o1","truth_value":"IN","reason":"premise"}]}}