297. Serialize and Deserialize Binary Tree

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.

For example, you may serialize the following tree

    1
   / \
  2   3
     / \
    4   5

as  "[1,2,3,null,null,4,5]" , just the same as  how LeetCode OJ serializes a binary tree . You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.

Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

思路：pre-order travesal 

/**
 * 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) {
        StringBuilder sb = new StringBuilder();
        preOrderTravel(root, sb);
        sb.setLength(sb.length()-1);
        return sb.toString();
    }
    public void preOrderTravel(TreeNode root, StringBuilder sb){
        if(root==null){
            sb.append("#,"); return;
        }else{
            sb.append(root.val+",");
            preOrderTravel(root.left, sb);
            preOrderTravel(root.right, sb);
        }
    }
    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        String[] vals = data.split(",");
        if(vals.length==0) return null;
        //need a global index, use size 1 array.
        int[] i = {0};
        return arrayToTree(vals,i);
    }
    public TreeNode arrayToTree(String[] vals, int[] i){
        if(i[0]>=vals.length || vals[i[0]].equals("#")) return null;
        TreeNode root = new TreeNode(Integer.valueOf(vals[i[0]]));
        i[0]++;
        root.left = arrayToTree(vals, i);
        i[0]++;
        root.right = arrayToTree(vals, i);
        return root;
    }
}

// Your Codec object will be instantiated and called as such:
// Codec codec = new Codec();
// codec.deserialize(codec.serialize(root));