-
Notifications
You must be signed in to change notification settings - Fork 31
/
1305.java
34 lines (31 loc) · 881 Bytes
/
1305.java
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
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
private List<Integer> l = new ArrayList<>();
private void inorderTraversal(TreeNode root){
if(root != null){
inorderTraversal(root.left);
l.add(root.val);
inorderTraversal(root.right);
}
}
public List<Integer> getAllElements(TreeNode root1, TreeNode root2) {
inorderTraversal(root1);
inorderTraversal(root2);
Collections.sort(l);
return l;
}
}