【2021秋冬】【剑指offer】37. 序列化二叉树

思路是对的，用层序遍历解决
但是层序遍历反推二叉树需要再熟悉一下

/**
 * 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 res = new StringBuilder("[");
        if(root==null) return "[]";
        Queue<TreeNode> q = new LinkedList<>();
        q.add(root);       
        while(!q.isEmpty()){
            TreeNode node = q.poll();
            
            if(node != null){
                res.append(node.val+",");
                q.add(node.left);
                q.add(node.right);
            }else res.append("null,");
        }
        res.deleteCharAt(res.length()-1);
        res.append("]");
        return res.toString();
        
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        if(data.equals("[]")) return null;
        String[] val = data.substring(1,data.length()-1).split(",");
        TreeNode root = new TreeNode(Integer.parseInt(val[0]));
        Queue<TreeNode> q = new LinkedList<>();
        q.add(root);
        int i=1;
        while(!q.isEmpty()){
            TreeNode node = q.poll();
            if(!val[i].equals("null")){
                node.left = new TreeNode(Integer.parseInt(val[i]));
                q.add(node.left);
            }
            i++;
            if(!val[i].equals("null")){
                node.right = new TreeNode(Integer.parseInt(val[i]));
                q.add(node.right);
            }
            i++;
        } 
        return root;
    }
}

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