LeetCode: 617. 合并二叉树
合并树
对数进行先序遍历
一个数遇到 null 把另一个的接下来的节点 赋值 到那个 null 上
class Solution {
public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
TreeNode dfs = dfs(t1, t2);
// [] \ [1] 的情况
if (dfs == t2){
return t2;
}
return t1;
}
public TreeNode dfs(TreeNode node1, TreeNode node2){
if(node1 == null){
return node2;
}
if(node2 == null){
return node1;
}
node1.val += node2.val;
node1.left = dfs(node1.left, node2.left);
node1.right = dfs(node1.right, node2.right);
return node1;
}
}