二叉树--合并两颗二叉树

我就是我 2022-05-24 20:12 219阅读 0赞

1、题目：

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.

2、解答：两个结点的值相加而已，再递归的调用即可。

3、C++代码

class Solution {
    public:
        TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
            if(t1 && t2){
                TreeNode *root = new TreeNode(t1->val + t2->val);
                root->left = mergeTrees(t1->left,t2->left);
                root->right = mergeTrees(t1->right,t2->right);
                return root;
            }else{
                return t1?t1:t2;
            }
        }
    };

python代码：

class Solution:
        def mergeTrees(self, t1, t2):
            """
            :type t1: TreeNode
            :type t2: TreeNode
            :rtype: TreeNode
            """
            if t1 and t2:
                root = TreeNode(t1.val+t2.val)
                root.left = self.mergeTrees(t1.left,t2.left)
                root.right = self.mergeTrees(t1.right,t2.right)
                return root
            else:
                return t1 or t2