Merge Two Binary Trees LeetCode617 java实现

本文链接：https://blog.csdn.net/qq_43208303/article/details/84579011

本文详细解析了二叉树合并算法的两种实现方法：直接遍历和深度优先搜索（DFS）。介绍了当两棵二叉树重叠时，如何通过求和节点值生成新的二叉树，以及当节点不重叠时的处理策略。适用于理解二叉树操作及算法设计。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.

You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.

Input: 
	Tree 1                     Tree 2                  
          1                         2                             
         / \                       / \                            
        3   2                     1   3                        
       /                           \   \                      
      5                             4   7                  
Output: 
Merged tree:
	     3
	    / \
	   4   5
	  / \   \ 
	 5   4   7

解法一：
以t1为合并的新树，同时遍历两棵树，遍历节点都存在则新节点为两节点值之和，若一方不存在返回另一个，都不存在返回Null。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(t1 == null && t2 == null)
            return null;
        if(t1 == null && t2 != null)
            return t2;
        if(t1 != null && t2 == null)
            return t1;
        t1.val = t1.val + t2.val;
        t1.left = mergeTrees(t1.left, t2.left);
        t1.right = mergeTrees(t1.right, t2.right);
        return t1;
    }
}

解法二：DFS遍历合并


/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
    public void DFS(TreeNode t1, TreeNode t2, TreeNode ans) {
        if (t1 != null && t2 != null) {
            ans.val = t1.val + t2.val;
            if (t1.left != null || t2.left != null) {
                ans.left = new TreeNode(0);
                DFS(t1.left, t2.left, ans.left);
            }
            if (t1.right != null || t2.right != null) {
                ans.right = new TreeNode(0);
                DFS(t1.right, t2.right, ans.right);
            }
            return;
        } else if (t1 != null) {
            ans.val = t1.val;
            if (t1.left != null) {
                ans.left = new TreeNode(0);
                DFS(t1.left, null, ans.left);
            }
            if (t1.right != null) {
                ans.right = new TreeNode(0);
                DFS(t1.right, null, ans.right);
            }
        } else if (t2 != null) {
            ans.val = t2.val;
            if (t2.left != null) {
                ans.left = new TreeNode(0);
                DFS(null, t2.left, ans.left);
            }
            if (t2.right != null) {
                ans.right = new TreeNode(0);
                DFS(null, t2.right, ans.right);
            }
        }
    }
    
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        TreeNode ans = null;
        if (t1 == null && t2 == null) {
            return ans;
        }
        ans = new TreeNode(0);
        DFS(t1, t2, ans);
        return ans;
    }