题目描述
- 请实现两个函数,分别用来序列化和反序列化二叉树
- 地址: 牛客地址
问题分析
- 先序遍历序列化和反序列化二叉树
- 层次遍历序列化和反序列化二叉树
经验教训
- 序列化时,val后面跟 “!”,用来隔离每一个节点的值,空结点用 “#” 表示
- 先序遍历如何反序列化的
- 层次遍历如何序列化和反序列化的
代码实现
String Serialize(TreeNode root) {
if (root == null) {
return "#!";
}
StringBuffer res = new StringBuffer();
res.append(root.val).append("!");
res.append(Serialize(root.left));
res.append(Serialize(root.right));
return res.toString();
}
TreeNode Deserialize(String str) {
String[] strArray = str.split("!");
LinkedList<String> queue = new LinkedList<>();
for (int i = 0; i < strArray.length; i++) {
queue.add(strArray[i]);
}
return Deserialize(queue);
}
TreeNode Deserialize(LinkedList<String> queue) {
String curString = queue.poll();
if("#".equals(curString)) {
return null;
}
TreeNode root = new TreeNode(Integer.valueOf(curString));
root.left = Deserialize(queue);
root.right = Deserialize(queue);
return root;
}
String Serialize(TreeNode root) {
if (root == null) {
return "#!";
}
StringBuffer res = new StringBuffer();
LinkedList<TreeNode> queue = new LinkedList<>();
queue.add(root);
res.append(root.val).append("!");
while (! queue.isEmpty()) {
TreeNode popNode = queue.pop();
if (popNode.left != null) {
queue.add(popNode.left);
res.append(popNode.left.val).append("!");
}else {
res.append("#!");
}
if (popNode.right != null) {
queue.add(popNode.right);
res.append(popNode.right.val).append("!");
}else {
res.append("#!");
}
}
return res.toString();
}
TreeNode Deserialize(String str) {
String[] nodeValues = str.split("!");
int i = 0;
TreeNode root = generateNodeByString(nodeValues[i++]);
if (root == null) {
return null;
}
LinkedList<TreeNode> nodeList = new LinkedList<>();
nodeList.add(root);
while(i < nodeValues.length) {
TreeNode curNode = nodeList.poll();
TreeNode leftNode = generateNodeByString(nodeValues[i++]);
curNode.left = leftNode;
if (leftNode != null) {
nodeList.add(leftNode);
}
TreeNode rightNode = generateNodeByString(nodeValues[i++]);
curNode.right = rightNode;
if(rightNode != null) {
nodeList.add(rightNode);
}
}
return root;
}
TreeNode generateNodeByString(String value) {
if("#".equals(value)) {
return null;
}else {
return new TreeNode(Integer.valueOf(value));
}
}