Merge Two Binary Trees
来源:互联网 发布:西安行知中学杨凌分校 编辑:程序博客网 时间:2024/05/22 10:42
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.
递归的时候把节点都接在左侧的树上,然后返回左边的节点
代码:
public TreeNode mergeTrees(TreeNode t1, TreeNode t2) { if(t1 == null && t2 == null) return null; if(t1 == null || t2 == null) return t1 == null? t2: t1; t1.val = t1.val + t2.val; TreeNode left = mergeTrees(t1.left, t2.left); TreeNode right = mergeTrees(t1.right, t2.right); t1.left = left; t1.right = 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
- PAT 1057. Stack (30) 中位数;树状数组
- #HDU1242 BFS
- xcode 如何使用#include <bits/stdc++.h>
- Linux 文件的常识
- EL表达式详细教程
- Merge Two Binary Trees
- 美发店员工合同WORD版(可直接下载打印)【卓美业网拓软件整理】
- ECMAScript 6:展开运算符 ...
- 关于新生成的物体生命周期执行顺序问题
- 双向分析Java面试
- EJB到底是什么?
- HDOJ4514 并查集判环+BFS求最长路
- ARP 地址解析协议
- 树状数组