617. 合并二叉树

617. 合并二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if(root1 == null && root2 == null)
            return null;
        if(root1 == null && root2 != null)
            return root2;
        if(root1 != null && root2 == null)
            return root1;
        // 到这里说明root1和root2都不为null
        TreeNode mergeNode = new TreeNode(root1.val + root2.val);
        mergeNode.left = mergeTrees(root1.left, root2.left);	// 到这里需要重新设定mergeNode 的左孩子和右孩子。
        mergeNode.right = mergeTrees(root1.right, root2.right);
        return mergeNode;
    }
}
  • 9
    点赞
  • 8
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
实现如下: ```c #include <stdio.h> #include <stdlib.h> struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; }; struct TreeNode* mergeTrees(struct TreeNode* t1, struct 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; } int main() { // 构造两棵树 struct TreeNode *t1 = (struct TreeNode*)malloc(sizeof(struct TreeNode)); struct TreeNode *t2 = (struct TreeNode*)malloc(sizeof(struct TreeNode)); t1->val = 1; t1->left = (struct TreeNode*)malloc(sizeof(struct TreeNode)); t1->left->val = 3; t1->left->left = (struct TreeNode*)malloc(sizeof(struct TreeNode)); t1->left->left->val = 5; t1->left->left->left = NULL; t1->left->left->right = NULL; t1->left->right = NULL; t1->right = (struct TreeNode*)malloc(sizeof(struct TreeNode)); t1->right->val = 2; t1->right->left = NULL; t1->right->right = NULL; t2->val = 2; t2->left = (struct TreeNode*)malloc(sizeof(struct TreeNode)); t2->left->val = 1; t2->left->left = NULL; t2->left->right = (struct TreeNode*)malloc(sizeof(struct TreeNode)); t2->left->right->val = 4; t2->left->right->left = NULL; t2->left->right->right = NULL; t2->right = (struct TreeNode*)malloc(sizeof(struct TreeNode)); t2->right->val = 3; t2->right->left = NULL; t2->right->right = (struct TreeNode*)malloc(sizeof(struct TreeNode)); t2->right->right->val = 7; t2->right->right->left = NULL; t2->right->right->right = NULL; // 合并两棵树 struct TreeNode *t = mergeTrees(t1, t2); // 输出合并后的树 printf("%d\n", t->val); printf("%d %d\n", t->left->val, t->right->val); printf("%d %d %d %d\n", t->left->left->val, t->left->right->val, t->right->left->val, t->right->right->val); return 0; } ``` 该程序的输出结果为: ``` 3 4 5 5 4 7 0 ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值