请实现两个函数,分别用来序列化和反序列化二叉树。这里不限定你的序列 / 反序列化算法执行逻辑,你只需要保证一个二叉树可以被序列化为一个字符串并且将这个字符串反序列化为原始的树结构。
困难难度,这道题和剑指 Offer 37. 序列化二叉树是同一道题。虽然标注为困难难度,但是实际上比较简单,序列化和反序列化使用DFS深度遍历即可。
// Encodes a tree to a single string.
public String serialize(TreeNode root) {
return serialize(root, new StringBuilder()).toString();
}
private StringBuilder serialize(TreeNode root, StringBuilder sb) {
if (root == null) {
sb.append("null,");
} else {
sb.append(root.val).append(",");
sb = serialize(root.left, sb);
sb = serialize(root.right, sb);
}
return sb;
}
// Decodes your encoded data to tree.
public TreeNode deserialize(String data) {
return deserialize(new LinkedList<>(Arrays.asList(data.split(","))));
}
private TreeNode deserialize(List<String> list) {
if (list.get(0).equals("null")) {
list.remove(0);
return null;
}
TreeNode root = new TreeNode(Integer.parseInt(list.remove(0)));
root.left = deserialize(list);
root.right = deserialize(list);
return root;
}