剑指 37. 序列化二叉树 - 难度困难

1. 题目描述

请实现两个函数，分别用来序列化和反序列化二叉树。

示例:
你可以将以下二叉树：
1
/ \
2 3
/ \
4 5

序列化为 “[1,2,3,null,null,4,5]”

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/xu-lie-hua-er-cha-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

2. 题解

1、序列化

根据题目描述，序列化的内容和层次遍历是一致的，这里当节点不存在时记为"null"，注意对于题目中的二叉树，按照序列化函数，结果应是：
“[1,2,3,null,null,4,5,null,null,null,null]”

2、反序列化

实质是根据层次遍历结果重建二叉树，创建到当前节点时，同时借助队列存储当前节点对应的左右子节点，以便于创建二叉树的下一层。

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */

/**
 * Encodes a tree to a single string.
 *
 * @param {TreeNode} root
 * @return {string}
 */
var serialize = function(root) {
    if(!root) return "[]";
    let res = "[";
    const queue = [];
    queue.push(root);
    while(queue.length > 0){
        let curr = queue.shift();
        if(curr){
            res = res + curr.val + ",";
            queue.push(curr.left);
            queue.push(curr.right);
        }else{
            res = res + "null,";
        }
    }
    //去掉最后一个逗号
    res = res.slice(0, res.length-1);
    res = res + "]";
    return res;
};

/**
 * Decodes your encoded data to tree.
 *
 * @param {string} data
 * @return {TreeNode}
 */
var deserialize = function(data) {
    if(data == "[]") return null;
    //去掉[]并转数组
    const arr = data.slice(1, data.length-1).split(",");
    const queue = [];
    let root = null;
    if(arr[0] != "null"){
        root = new TreeNode(Number(arr[0]));
        queue.push(root);
    }
    let i = 1;
    while(queue.length > 0){
        let curr = queue.shift();
        if(arr[i] != "null"){
            curr.left = new TreeNode(Number(arr[i]));
            queue.push(curr.left);
        }
        i++;
        if(arr[i] != "null"){
            curr.right = new TreeNode(Number(arr[i]));
            queue.push(curr.right);
        }
        i++;
    }
    return root;
};

/**
 * Your functions will be called as such:
 * deserialize(serialize(root));
 */