-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
42 lines (37 loc) · 984 Bytes
/
Main.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
35
36
37
38
39
40
41
42
package com.company;
import java.util.ArrayList;
import java.util.List;
import java.util.PriorityQueue;
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;
}
}
public class Main {
public static void main(String[] args) {
// write your code here
}
PriorityQueue<Integer> heap;
public List<Integer> getAllElements(TreeNode root1, TreeNode root2) {
heap = new PriorityQueue<Integer>();
dfs(root1);
dfs(root2);
List<Integer> res = new ArrayList<>();
while (!heap.isEmpty())
res.add(heap.poll());
return res;
}
public void dfs(TreeNode node){
if(node == null) return;
dfs(node.left);
heap.offer(node.val);
dfs(node.right);
}
}