leetcode---617. Merge Two Binary Trees
来源:互联网 发布:火女永恒矩阵 编辑:程序博客网 时间:2024/06/15 20:50
题目:
其实只要知道树的构造方法,那么这题也就没有难度了。但是注意要判断没有T1,或者没有T2的情况。
代码如下:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) { if(!t1) return t2; if(!t2) return t1; TreeNode* node=new TreeNode(t1->val+t2->val) ; node->left= mergeTrees(t1->left,t2->left); node->right=mergeTrees(t1->right,t2->right); return node; }};
阅读全文
0 0
- [leetcode]617. Merge Two Binary Trees
- leetcode.617.Merge Two Binary Trees
- [leetcode]: 617. Merge Two Binary Trees
- [Leetcode]617. Merge Two Binary Trees
- LeetCode 617. Merge Two Binary Trees (C++)
- LeetCode 617. Merge Two Binary Trees
- [LeetCode] 617. Merge Two Binary Trees
- LeetCode 617. Merge Two Binary Trees
- 【Leetcode】617. Merge Two Binary Trees
- [LeetCode]617.Merge Two Binary Trees
- LeetCode: 617. Merge Two Binary Trees
- Leetcode 617. Merge Two Binary Trees
- [leetcode]617. Merge Two Binary Trees
- [Leetcode] 617. Merge Two Binary Trees
- [LeetCode]617. Merge Two Binary Trees
- leetcode 617. Merge Two Binary Trees
- 【LeetCode】617. Merge Two Binary Trees
- [LeetCode]617. Merge Two Binary Trees<Java>
- 升实训一般面试题
- 老工程师教你如何搭建智能家居控制系统
- 迪米特原则
- uva10092
- Android System Properties Dynamic
- leetcode---617. Merge Two Binary Trees
- Redis管道(pipeline)
- 扩展系统功能——装饰模式(一)
- uva10080
- element-ui 给页面上的DOM元素加loading效果
- 你想找的Python资料这里全都有!没有你找不到!史上最全资料合集
- FMI飞马网 | AI人工智能:54份行业重磅报告汇总(附下载)
- 金融级数据库的未来发展方向
- oracle日期处理(年月格式)加/减一个月