【leetcode】617. Merge Two Binary Trees

最新推荐文章于 2025-01-12 11:51:27 发布

原创最新推荐文章于 2025-01-12 11:51:27 发布 · 116 阅读

0 ·

CC 4.0 BY-SA版权

解题报告同时被 2 个专栏收录

203 篇文章

订阅专栏

leetcode题解大全

115 篇文章

订阅专栏

本文探讨了如何将两棵二叉树合并为一棵新树的算法，当两棵树的节点重叠时，将节点值相加作为新节点的值；否则，非空节点将构成新树的节点。通过递归方法实现这一过程，从根节点开始进行合并。

摘要生成于 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.

Example 1:

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

Note: The merging process must start from the root nodes of both trees.

题解如下：

/**
 * 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)
            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;
    }
}