Merge Two Binary Trees
来源:互联网 发布:培训交互设计师知乎 编辑:程序博客网 时间:2024/05/01 08:28
解题思路:
1、前序遍历
2、判断当前位置的节点是否都存在:若都存在,二者的和为新节点;若只存在一个,存在的节点为新节点。
代码:
public 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); t2.right = mergeTrees(t1.right,t2.right); return t1;}
阅读全文
0 0
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- 617. Merge Two Binary Trees
- Leetcode617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- leetcode617: Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 【leetcode】 Merge Two Binary Trees
- leetcode617. Merge Two Binary Trees
- linux 系统文件系统无法写访问
- 用JAVA实现的webServer开发流程
- PrintN的循环执行和递归执行
- 教大家微信里投票的怎么刷票及微信投票怎么免费刷票攻略
- Mac客户端下使用多个git账号
- Merge Two Binary Trees
- C++多态总结(一)
- 常用正则表达式汇总
- 菜鸟学习历程【10】机器字节序、大小端的判断与修改
- JAVA | 10
- 图的广度搜索(C语言版)
- Tensorflow学习(3)参数初始化
- 十三:表达式if ... else
- 算法练习(24):Counting Bits