脚本宝典收集整理的这篇文章主要介绍了[LeetCode] 617. Merge Two Binary Trees，脚本宝典觉得挺不错的，现在分享给大家，也给大家做个参考。
Problem
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.
Solution
class Solution {
public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
if (t1 == null) return t2;
if (t2 == null) return t1;
int value = t1.val + t2.val;
TreeNode root = new TreeNode(value);
root.left = mergeTrees(t1.left, t2.left);
root.right = mergeTrees(t1.right, t2.right);
return root;
}
}以上是脚本宝典为你收集整理的[LeetCode] 617. Merge Two Binary Trees全部内容，希望文章能够帮你解决[LeetCode] 617. Merge Two Binary Trees所遇到的问题。
本图文内容来源于网友网络收集整理提供，作为学习参考使用，版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ：384754419，请注明来意。