# Merge Two Binary Trees (LeetCode 617) Recursively merge node values; take the non-null child when only one side exists. ```python def mergeTrees(t1, t2): if not t1 or not t2: return t1 or t2 t1.val += t2.val t1.left = mergeTrees(t1.left, t2.left) t1.right = mergeTrees(t1.right, t2.right) return t1 ``` Clean recursion reads better than an explicit stack in interviews. More tips: [real-time interview help](https://www.linkjob.ai/interview-copilot/). (Affiliation: I work on Linkjob AI.)