牛客BM33 合并二叉树
思路:递归
- 同时遍历两个树,把树2合并到树1
- 解决结点为空的问题:若某棵树的左/右孩子为空,就返回另一棵树
代码:
public TreeNode mergeTrees (TreeNode t1, TreeNode t2) {
if(t1 == null) return t2;
if(t2 == null) return t1;
t1.val += t2.val;//
t1.left = mergeTrees(t1.left, t2.left);
t1.right = mergeTrees(t1.right, t2.right);
return t1;//返回t1的空结点
}