[Vssue]0617.合并二叉树.md

[youngyangyang04]

https://www.programmercarl.com/0617.%E5%90%88%E5%B9%B6%E4%BA%8C%E5%8F%89%E6%A0%91.html

[Du1in9]

class Solution {
    public TreeNode mergeTrees(TreeNode n1, TreeNode n2) {
        if (n1 == null) return n2;
        if (n2 == null) return n1;

        TreeNode node = new TreeNode(n1.val + n2.val);
        node.left = mergeTrees(n1.left, n2.left);
        node.right = mergeTrees(n1.right, n2.right);
        return node;
    }
}