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.

Credits:
Special thanks to  @Louis1992 for adding this problem and creating all test cases.

思路：用preorder traverse，current，left, right来serialize，然后用queue来deserilize，这题跟BST不同的是，这里需要serilize NULL，因为BST有大小关系，这里没有，所以需要满树才行；而且这里就不需要Integer.MAX_VALUE和Integer.MIN_VALUE作为参数来判断是否return null了，这个复杂度是O(N);

错误点：不能想到用preorder来serialize，并且用queue来deserilize；

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Codec {
    private String NULL = "NULL";
    private String DELIMITER = "#";
    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        StringBuilder sb = new StringBuilder();
        dfs(root, sb);
        return sb.toString();
    }
    
    private void dfs(TreeNode root, StringBuilder sb) {
        if(root == null) {
            sb.append(NULL).append(DELIMITER);
        } else {
            sb.append(root.val).append(DELIMITER);
            dfs(root.left, sb);
            dfs(root.right, sb);
        }
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        if(data == null || data.equals(NULL)) {
            return null;
        }
        String[] splits = data.split(DELIMITER);
        Queue<String> queue = new LinkedList<>();
        for(String split: splits) {
            queue.offer(split);
        }
        return buildTree(queue);
    }
    
    private TreeNode buildTree(Queue<String> queue) {
        if(queue.isEmpty()) {
            return null;
        }
        String str = queue.poll();
        if(str.equals(NULL)) {
            return null;
        } else {
            TreeNode node = new TreeNode(Integer.parseInt(str));
            node.left = buildTree(queue);
            node.right = buildTree(queue);
            return node;
        }
    }
}

// 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));