/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
// Your Codec object will be instantiated and called as such:
// Codec ser = new Codec();
// Codec deser = new Codec();
// TreeNode ans = deser.deserialize(ser.serialize(root));
// 本题和【剑指offer】37. 序列化二叉树 一模一样
// 序列化函数很简单,层序遍历稍微改一改就行,主要难在反序列化函数的实现,
// 反序列化函数的实现难在,已知二叉树层序遍历,重建二叉树。
// 其实说难也不难,就是再次按照层序遍历,给相应位置赋给TreeNode
//
// 执行用时:23 ms, 在所有 Java 提交中击败了49.31%的用户
// 内存消耗:40.7 MB, 在所有 Java 提交中击败了47.77%的用户
public class Codec {
// Encodes a tree to a single string.
public String serialize(TreeNode root) {
if (root == null)
return "[]";
StringBuilder sb = new StringBuilder();
sb.append("[");
LinkedList<TreeNode> q = new LinkedList<>();
q.add(root);
while (!q.isEmpty()) {
TreeNode cur = q.removeFirst();
if (cur != null) {
sb.append(cur.val + ",");
q.add(cur.left);
q.add(cur.right);
}
else {
sb.append("null" + ",");
}
}
sb.delete(sb.length() - 1, sb.length());
sb.append("]");
return sb.toString();
}
// Decodes your encoded data to tree.
public TreeNode deserialize(String data) {
if (data.equals("[]"))
return null;
String indata = data.substring(1, data.length() - 1);
String[] vals = indata.split(",");
LinkedList<TreeNode> q = new LinkedList<>();
int i = 0;
TreeNode head = new TreeNode(Integer.parseInt(vals[i++]));
q.add(head);
while (!q.isEmpty()) {
TreeNode node = q.remove();
if (!vals[i].equals("null")) {
node.left = new TreeNode(Integer.parseInt(vals[i]));
q.add(node.left);
}
i++;
if (!vals[i].equals("null")) {
node.right = new TreeNode(Integer.parseInt(vals[i]));
q.add(node.right);
}
i++;
}
return head;
}
}