Serialize and Deserialize Binary Tree

Design an algorithm and write code to serialize and deserialize a binary tree. Writing the tree to a file is called 'serialization' and reading back from the file to reconstruct the exact same binary tree is 'deserialization'.

There is no limit of how you deserialize or serialize a binary tree, you only need to make sure you can serialize a binary tree to a string and deserialize this string to the original structure.

Example

An example of testdata: Binary tree {3,9,20,#,#,15,7}, denote the following structure:

  3
 / \
9  20
  /  \
 15   7

Our data serialization use bfs traversal. This is just for when you got wrong answer and want to debug the input.

You can use other method to do serializaiton and deserialization.

分析：

利用preorder + full tree的性质, 我们可以把bt还原。对于一个full tree, 当我们用recursion 还原完成左边部分后，剩余部分永远是属于右边部分的。

 public class Codec {
     private static final String spliter = ",";
     private static final String NN = "X";

     // Encodes a tree to a single string.
     public String serialize(TreeNode root) {
         StringBuilder sb = new StringBuilder();
         buildString(root, sb);
         return sb.toString();
     }

     private void buildString(TreeNode node, StringBuilder sb) {
         if (node == null) {
             sb.append(NN).append(spliter);
         } else {
             sb.append(node.val).append(spliter);
             buildString(node.left, sb);
             buildString(node.right,sb);
         }
     }
     // Decodes your encoded data to tree.
     public TreeNode deserialize(String data) {
         Deque<String> nodes = new LinkedList<>();
         nodes.addAll(Arrays.asList(data.split(spliter)));
         return buildTree(nodes);
     }

     private TreeNode buildTree(Deque<String> nodes) {
         String val = nodes.remove();
         if (val.equals(NN)) return null;
         else {
             TreeNode node = new TreeNode(Integer.valueOf(val));
             node.left = buildTree(nodes);
             node.right = buildTree(nodes);
             return node;
         }
     }
 }