{"id":"build-helper-uses-list-pop-zero","text":"`_build` constructs trees via BFS using `queue.pop(0)`, which is O(n) per pop on a Python list, making tree construction O(n^2) — acceptable for small test inputs but not optimal","truth_value":"OUT","source":"entries/2026/06/06/subtree-of-another-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["de-facto-treenode-infra-efficient","duplication-cost-free-when-implementations-correct"],"metadata":{"_retracted":true},"created_at":"","updated_at":"2026-06-17T15:31:06+00:00","reviewed_at":"","verified_at":"","retracted_at":"2026-06-17T15:31:06+00:00","explanation":{"steps":[{"node":"build-helper-uses-list-pop-zero","truth_value":"OUT","reason":"retracted premise"}]}}