-
Notifications
You must be signed in to change notification settings - Fork 13
/
SerializeBTree297.java
53 lines (49 loc) · 1.32 KB
/
SerializeBTree297.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
package Leetcode;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
public class SerializeBTree297 {
/**Method: DFS; Time:O(N); Space: O(N) **/
// Encodes a tree to a single string.
public String serialize(TreeNode root) {
return serialize(root, "");
}
private String serialize(TreeNode root, String str) {
if(root == null) {
str += "None,";
} else {
str += String.valueOf(root.val) + ",";
str = serialize(root.left, str);
str = serialize(root.right, str);
}
return str;
}
// Decodes your encoded data to tree.
public TreeNode deserialize(String data) {
return deserialize(new LinkedList<>(Arrays.asList(data.split(","))));
}
private TreeNode deserialize(List<String> data) {
if(data.get(0).equals("None")) {
data.remove(0);
return null;
}
TreeNode cur = new TreeNode(Integer.valueOf(data.get(0)));
data.remove(0);
cur.left = deserialize(data);
cur.right = deserialize(data);
return cur;
}
//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;
}
}
}