{"id":"invert-tree-tuple-swap-prevents-clobber","text":"The simultaneous assignment `root.left, root.right = invert_tree(root.right), invert_tree(root.left)` evaluates both recursive calls before either assignment executes, preventing the bug where overwriting `root.left` first would lose the original left subtree before the right-side recursion reads it.","truth_value":"IN","source":"entries/2026/06/06/invert-binary-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"invert-tree-tuple-swap-prevents-clobber","truth_value":"IN","reason":"premise"}]}}