17. Merge Two Binary Trees 融合二叉树

［抄题］：

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

[暴力解法]：

时间分析：

空间分析：

［奇葩输出条件］：

［奇葩corner case］：

［思维问题］：

以为要从上往下讨论是否有空节点：实际上是讨论不出来的，特殊情况要当作corner case提前列出来，实现自动判断

［一句话思路］：

左边和左边融合，右边和右边融合

［输入量］：空：正常情况：特大：特小：程序里处理到的特殊情况：异常情况（不合法不合理的输入）：

［画图］：

［一刷］：

出现新的数值就要新建一个节点：以前真不知道
左、右子树情况不同时，分为node.left 和node.right两边去讨论就行了，第二次见了应该学会了

［二刷］：

［三刷］：

［四刷］：

［五刷］：

[五分钟肉眼debug的结果]：

［总结］：

［复杂度］：Time complexity: O(n) Space complexity: O(n)

［英文数据结构或算法，为什么不用别的数据结构或算法］：

左右讨论还是用的traverse嵌套

［关键模板化代码］：

//left & right :divide into node's left & node's rightnode.left = mergeTrees(t1.left, t2.left);node.right = mergeTrees(t1.right, t2.right);

［其他解法］：

［Follow Up］：

［LC给出的题目变变变］：

[代码风格] ：

/*** 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) {//corner case:left is null or right is nullif (t1 == null) {return t2;}if (t2 == null) {return t1;}//left.val + right.val: new val needs new nodeTreeNode node = new TreeNode(t1.val + t2.val);//left & right :divide into node's left & node's rightnode.left = mergeTrees(t1.left, t2.left);node.right = mergeTrees(t1.right, t2.right);return node;}
}

View Code

转载于:https://www.cnblogs.com/immiao0319/p/8566678.html

17. Merge Two Binary Trees 融合二叉树相关推荐

C#LeetCode刷题之#617-合并二叉树（Merge Two Binary Trees）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/4096 访问. 给定两个二叉树,想象当你将它们中的一个覆盖到另一个 ...
617.Merge Two Binary Trees(合并两棵树)
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of t ...
LeetCode 617. Merge Two Binary Trees
题目: Given two binary trees and imagine that when you put one of them to cover the other, some nodes ...
leetcode 617. Merge Two Binary Trees | 617. 合并二叉树（Java）
题目 https://leetcode-cn.com/problems/merge-two-binary-trees/ 题解测试用例输入: [1,3,2,5] [2,1,3,null,4,null ...
【Tree-easy】617. Merge Two Binary Trees 合并两个二叉树
1. 题目原址 https://leetcode.com/problems/merge-two-binary-trees/ 2. 题目描述 3. 题目大意给定两个二叉树,现在要求将这两个二叉树合并, ...
3/100. Merge Two Binary Trees
将两个二叉树相同位置的数值相加,相加的方法一样,则使用递归法挨个相加即可. # Definition for a binary tree node. # class TreeNode: # def _ ...
[leetcode] 617. Merge Two Binary Trees
题目描述给定两棵树,要求合并它们,如果节点重合则新合并的树的节点为它们之和,否则不变. 思路简单递归,c语言怎么创建新节点忘记了,就直接写的. 代码 /*** Definition for a b ...
Given two binary trees, write a function to check if they areequal or not.
Given two binary trees, write a function to check if they areequal or not. Two binary trees are cons ...
(数据结构基础)Among the following threaded binary trees (the threads are represented by dotted curves),……
当年学这些的时候真的是苦于没有人讲,现在复习考研,我会见到这种题就写下来,学弟学妹们欢迎点个关注,最近也在创业想实习的可以找我联系:没看懂的话是我表述有问题,欢迎指出和私戳. Among the fo ...

17. Merge Two Binary Trees 融合二叉树

17. Merge Two Binary Trees 融合二叉树相关推荐

最新文章

热门文章