[leetcode]297. Serialize and Deserialize Binary Tree

时间空间都是o（n）

/**
 * 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 "";
        Queue<TreeNode> queue = new LinkedList<>();
        StringBuffer s = new StringBuffer();
        queue.offer(root);
        
        while(!queue.isEmpty()){
            TreeNode node = queue.poll();
            if(node == null){
                s.append("null,");
                continue;
            }
            s.append(node.val + ",");
            queue.offer(node.left);
            queue.offer(node.right);
        }
        
        return s.toString();
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        if(data == "") return null;
        Queue<TreeNode> queue = new LinkedList<>();
        String[] s = data.split(",");
        
        TreeNode root = new TreeNode(Integer.parseInt(s[0]));
        queue.offer(root);
        for(int i = 1;i < s.length;i++){
            TreeNode cur = queue.poll();
            if(!s[i].equals("null")){
                cur.left = new TreeNode(Integer.parseInt(s[i]));
                queue.offer(cur.left);
            }
            i++;
            if(!s[i].equals("null")){
                cur.right = new TreeNode(Integer.parseInt(s[i]));
                queue.offer(cur.right);
            }
            
        }
        return root;
    }
}

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