-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
64 lines (54 loc) · 1.66 KB
/
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package com.company;
import com.sun.source.tree.Tree;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.TreeMap;
class Node {
public int val;
public List<Node> children;
public Node() {
children = new ArrayList<Node>();
}
public Node(int _val) {
val = _val;
children = new ArrayList<Node>();
}
public Node(int _val, ArrayList<Node> _children) {
val = _val;
children = _children;
}
}
public class Main {
public static void main(String[] args) {
// write your code here
}
public Node cloneTree_bfs(Node root) {
if(root == null) return null;
Node clone = new Node(root.val);
ArrayDeque<Node> queue = new ArrayDeque<>(){{offer(root);}};
ArrayDeque<Node> cloneQueue = new ArrayDeque<>(){{offer(clone);}};
while (!queue.isEmpty()){
int count = queue.size();
for (int i = 0; i < count; i++) {
Node cur = queue.poll();
Node cloneCur = cloneQueue.poll();
for (Node child : cur.children){
if(child == null) continue;
Node cloneChild = new Node(child.val);
cloneCur.children.add(cloneChild);
queue.offer(child);
cloneQueue.offer(cloneChild);
}
}
}
return clone;
}
public Node cloneTree_dfs(Node root) {
if(root == null) return null;
Node clone = new Node(root.val);
for (Node child : root.children)
clone.children.add(cloneTree_dfs(child));
return clone;
}
}