{"id":"dfs-short-circuits-via-and-chain","text":"Tree DFS solutions use Python's `and` short-circuit evaluation (`node.val == target and dfs(left) and dfs(right)`) to stop traversal immediately on the first failing condition.","truth_value":"IN","source":"entries/2026/06/06/univalued-binary-tree-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"dfs-short-circuits-via-and-chain","truth_value":"IN","reason":"premise"}]}}