Merge Two Binary Trees
Posted beiyeqingteng
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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
1 /** 2 * Definition for a binary tree node. 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */ 10 class Solution { 11 public TreeNode mergeTrees(TreeNode t1, TreeNode t2) { 12 if (t1 == null && t2 == null) return null; 13 if (t1 == null) { 14 return t2; 15 } 16 if (t2 == null) { 17 return t1; 18 } 19 TreeNode treeNode = new TreeNode(t1.val + t2.val); 20 treeNode.left = mergeTrees(t1.left, t2.left); 21 treeNode.right = mergeTrees(t1.right, t2.right); 22 return treeNode; 23 } 24 }
以上是关于Merge Two Binary Trees的主要内容,如果未能解决你的问题,请参考以下文章