/
_0297_SerializeAndDeserializeBinaryTree.java
75 lines (68 loc) · 1.79 KB
/
_0297_SerializeAndDeserializeBinaryTree.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
65
66
67
68
69
70
71
72
73
74
75
package com.diguage.algorithm.leetcode;
import com.diguage.algorithm.util.TreeNode;
import java.util.LinkedList;
import java.util.Queue;
/**
* = 297. Serialize and Deserialize Binary Tree
* <p>
* https://leetcode.com/problems/serialize-and-deserialize-binary-tree/[Serialize and Deserialize Binary Tree - LeetCode]
*
* @author D瓜哥, https://www.diguage.com/
* @since 2020-06-16 22:01
*/
class Codec {
// Encodes a tree to a single string.
public String serialize(TreeNode root) {
if (root == null) {
return "#!";
}
String result = root.val + "!";
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
root = queue.poll();
if (root.left != null) {
result += root.left.val + "!";
queue.offer(root.left);
} else {
result += "#!";
}
if (root.right != null) {
result += root.right.val + "!";
queue.offer(root.right);
} else {
result += "#!";
}
}
return result;
}
// Decodes your encoded data to tree.
public TreeNode deserialize(String data) {
String[] values = data.split("!");
int index = 0;
TreeNode head = generate(values[index++]);
Queue<TreeNode> queue = new LinkedList<>();
if (head != null) {
queue.offer(head);
}
TreeNode node = null;
while (!queue.isEmpty()) {
node = queue.poll();
node.left = generate(values[index++]);
node.right = generate(values[index++]);
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
return head;
}
private TreeNode generate(String val) {
if ("#".equals(val)) {
return null;
}
return new TreeNode(Integer.parseInt(val));
}
}