Loading...

递归-合并二叉树

在这里插入图片描述 在这里插入图片描述

求解代码

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
public TreeNode mergeTrees (TreeNode t1, TreeNode t2) {
        if(t1==null){
			return t2;
		}

		if(t2==null){
			return t1;
		}

		TreeNode head = new TreeNode(t1.val+t2.val);
		head.left = mergeTrees(t1.left, t2.left);
		head.right = mergeTrees(t1.right, t2.right);

		return head;

    }
最后更新于 2026-04-05 17:35:33
Code Road Record