-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeTwoBinaryTrees.java
More file actions
46 lines (36 loc) · 1006 Bytes
/
MergeTwoBinaryTrees.java
File metadata and controls
46 lines (36 loc) · 1006 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/**
* Created by devpriyadave on 2/19/18.
*
* 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.
Input:
Tree 1 Tree 2
1 2
/ \ / \
3 2 1 3
/ \ \
5 4 7
Output:
Merged tree:
3
/ \
4 5
/ \ \
5 4 7
*/
public class MergeTwoBinaryTrees {
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
return null;
}
public static void main(String[] args) {
}
}