/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Codec {
String SEP=",";
String NULL="#";
// Encodes a tree to a single string.
public String serialize(TreeNode root) {
StringBuilder sb=new StringBuilder();
serializer(root,sb);
return sb.toString();
}
public void serializer(TreeNode root,StringBuilder sb){
if (root==null){
sb.append(NULL).append(SEP);
return;
}
sb.append(root.val).append(SEP);
serializer(root.left,sb);
serializer(root.right,sb);
}
// Decodes your encoded data to tree.
public TreeNode deserialize(String data) {
LinkedList<String> nodes=new LinkedList<>();
for (String s: data.split(SEP)){
nodes.addLast(s);
}
return deserializer(nodes);
}
public TreeNode deserializer(LinkedList<String> nodes){
if (nodes.isEmpty()) return null;
String first=nodes.removeFirst();
if (first.equals(NULL)) return null;
TreeNode root=new TreeNode(Integer.parseInt(first));
root.left = deserializer(nodes);
root.right = deserializer(nodes);
return root;
}
}
// 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));
297 序列化和反序列化
最新推荐文章于 2024-07-15 21:55:17 发布