{"id":"short-circuit-left-before-right","text":"`getTargetCopy` checks the left subtree result before recursing right; if the target is found left, the right subtree is never visited.","truth_value":"IN","source":"entries/2026/06/06/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"short-circuit-left-before-right","truth_value":"IN","reason":"premise"}]}}