做网站开发没有人带,网站分为那几个模块,如何建立网站管理系统,wordpress索引插件提示#xff1a;文章写完后#xff0c;目录可以自动生成#xff0c;如何生成可参考右边的帮助文档 文章目录 前言一、力扣297. 二叉树的序列化与反序列化二、力扣二叉树后序序列化三、力扣二叉树层序序列化与反序列化 要说序列化和反序列化#xff0c;得先从 JSON 数据格式… 提示文章写完后目录可以自动生成如何生成可参考右边的帮助文档 文章目录 前言一、力扣297. 二叉树的序列化与反序列化二、力扣二叉树后序序列化三、力扣二叉树层序序列化与反序列化 要说序列化和反序列化得先从 JSON 数据格式说起。 JSON 的运用非常广泛比如我们经常将变成语言中的结构体序列化成JSON 字符串存入缓存或者通过网络发送给远端服务消费者接受JSON 字符串然后进行反序列化就可以得到原始数据了。 这就是序列化和反序列化的目的以某种特定格式组织数据使得数据可以独立于编程语言。 那么假设现在有一棵用 Java 实现的二叉树我想把它通过某些方式存储下来然后用 C 读取这棵并还原这棵二叉树的结构怎么办这就需要对二叉树进行序列化和反序列化了。
前言 一、力扣297. 二叉树的序列化与反序列化
/*** 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();serialize(root,sb);return sb.toString();}// Decodes your encoded data to tree.public TreeNode deserialize(String data) {LinkedListString list new LinkedList();for(String s : data.split(SEP)){list.add(s);}return fun(list); }public TreeNode fun(LinkedListString list){if(list.isEmpty()){return null;}String first list.removeFirst();if(first.equals(NULL)){return null;}TreeNode cur new TreeNode(Integer.parseInt(first));cur.left fun(list);cur.right fun(list);return cur;}public void serialize(TreeNode root, StringBuilder sb){if(root null){sb.append(NULL).append(SEP);return;}sb.append(root.val).append(SEP);serialize(root.left,sb);serialize(root.right,sb);}
}// 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));二、力扣二叉树后序序列化
/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val x; }* }*/
public class Codec {// Encodes a tree to a single string.public String serialize(TreeNode root) {if(root null){return #;}String l serialize(root.left);String r serialize(root.right);return l , r , root.val;}// Decodes your encoded data to tree.public TreeNode deserialize(String data) {LinkedListString list new LinkedList();for(String s : data.split(,)){list.add(s);}return fun(list);}public TreeNode fun(LinkedListString list){String last list.removeLast();if(last.equals(#)){return null;}TreeNode cur new TreeNode(Integer.parseInt(last));cur.right fun(list);cur.left fun(list);return cur;}
}// 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));三、力扣二叉树层序序列化与反序列化
/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val x; }* }*/
public class Codec {// Encodes a tree to a single string.public String serialize(TreeNode root) {if(root null){return ;}StringBuilder sb new StringBuilder();DequeTreeNode deq new LinkedList();deq.offerLast(root);while(!deq.isEmpty()){int len deq.size();for(int i 0; i len; i ){TreeNode cur deq.pollFirst();if(cur null){sb.append(#).append(,);continue;}sb.append(cur.val).append(,);deq.offerLast(cur.left);deq.offerLast(cur.right);}}return sb.toString();}// Decodes your encoded data to tree.public TreeNode deserialize(String data) {if(data.isEmpty()){return null;}String[] da data.split(,);TreeNode root new TreeNode(Integer.parseInt(da[0]));DequeTreeNode deq new ArrayDeque();int index 0;deq.offerLast(root);while(!deq.isEmpty()){int len deq.size();for(int i 0; i len; i ){TreeNode cur deq.pollFirst();index ;if(!da[index].equals(#)){cur.left new TreeNode(Integer.parseInt(da[index]));deq.offerLast(cur.left);}index ;if(!da[index].equals(#)){cur.right new TreeNode(Integer.parseInt(da[index]));deq.offerLast(cur.right);}}}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));
