序列化二叉树
题目描述
请实现两个函数,分别用来序列化和反序列化二叉树
/** * * @author gentleKay * 题目描述 * 请实现两个函数,分别用来序列化和反序列化二叉树 * * 用例: * {8,6,10,5,7,9,11} * 对应输出应该为: * {8,6,10,5,7,9,11} * 你的输出为: * {} */ public class Main59 { public static void main(String[] args) { // TODO Auto-generated method stub } public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } TreeNode r; public String Serialize(TreeNode root) { r = root; return null; } public TreeNode Deserialize(String str) { return r; } }