二叉树的序列化和反序列化
题目:
描述
设计一个算法,并编写代码来序列化和反序列化二叉树。将树写入一个文件被称为“序列化”,读取文件后重建同样的二叉树被称为“反序列化”。
如何反序列化或序列化二叉树是没有限制的,你只需要确保可以将二叉树序列化为一个字符串,并且可以将字符串反序列化为原来的树结构。
对二进制树进行反序列化或序列化的方式没有限制,LintCode 将您的 serialize 输出作为 deserialize 的输入,它不会检查序列化的结果。
样例
样例 1:
输入:
tree = {3,9,20,#,#,15,7}
输出:
{3,9,20,#,#,15,7}
解释:
二叉树 {3,9,20,#,#,15,7},表示如下的树结构:
3
/ \
9 20
/ \
15 7
它将被序列化为 {3,9,20,#,#,15,7}
样例 2:
输入:
tree = {1,2,3}
输出:
{1,2,3}
解释:
二叉树 {1,2,3},表示如下的树结构:
1
/ \
2 3
它将被序列化为 {1,2,3}
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* This method will be invoked first, you should design your own algorithm
* to serialize a binary tree which denote by a root node to a string which
* can be easily deserialized by your own "deserialize" method later.
*/
public String serialize(TreeNode root) {
// write your code here
if(root == null) {
return "{}";
}
List<TreeNode> nodes = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()) {
TreeNode node = queue.poll();
nodes.add(node);
if(node == null) {
continue ;
}
queue.offer(node.left);
queue.offer(node.right);
}
while(nodes.get(nodes.size() - 1) == null) {
nodes.remove(nodes.size() - 1);
}
StringBuffer sb = new StringBuffer();
sb.append("{");
for(int i = 0; i < nodes.size(); i++) {
TreeNode node = nodes.get(i);
if(i > 0) {
sb.append(",");
}
if(node == null) {
sb.append("#");
} else {
sb.append(node.val);
}
}
sb.append("}");
return sb.toString();
}
/**
* This method will be invoked second, the argument data is what exactly
* you serialized at method "serialize", that means the data is not given by
* system, it's given by your own serialize method. So the format of data is
* designed by yourself, and deserialize it here as you serialize it in
* "serialize" method.
*/
public TreeNode deserialize(String data) {
// write your code here
if (data.equals("{}")) {
return null;
}
String[] nodes = data.substring(1, data.length() - 1).split(",");
Queue<TreeNode> queue = new LinkedList();
TreeNode root = getNode(nodes[0]);
int len = nodes.length;
int idx = 1;
queue.offer(root);
while(!queue.isEmpty()) {
if(idx < len) {
int size = queue.size();
for(int i = 0; i < size; i++) {
TreeNode node = queue.poll();
node.left = getNode(nodes[idx]);
if(node.left != null) {
queue.offer(node.left);
}
idx++;
if(idx >= len) {
break ;
}
node.right = getNode(nodes[idx]);
if(node.right != null) {
queue.offer(node.right);
}
idx++;
if(idx >= len) {
break ;
}
}
} else {
break ;
}
}
return root;
}
private TreeNode getNode(String data) {
if(data.equals("#")) {
return null;
} else {
return new TreeNode(Integer.parseInt(data));
}
}
}