LeetCode: 297. Serialize and Deserialize Binary Tree

LeetCode: 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.

Example:

You may serialize the following tree:

    1
   / \
  2   3
     / \
    4   5

as "[1,2,3,null,null,4,5]"

Clarification: The above format is the same as how LeetCode 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.

解题思路 —— 层次遍历

1. 序列化：层次遍历二叉树，将遍历顺序存入字符串。
2. 反序列化：按照层次遍历的思路，重新构建原有二叉树。

AC 代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Codec {
private:
    void spiltData(string data, vector<string>& treeVec){
        data = data.substr(1, data.size()-2);
        
        size_t beg = 0;
        size_t end = 0;
        while (beg != data.size()) {
            end = data.find_first_of(',', beg);
            treeVec.push_back(data.substr(beg, end-beg));
            
            if (end == data.npos) break;
            else beg = end + 1;
        }
    }
public:
    // Encodes a tree to a single string.
    string serialize(TreeNode* root) {
        if (root == nullptr) return "[]";
      
        string treeStr = "[";
        queue<TreeNode*> que;
        treeStr += to_string(root->val);
        que.push(root);
        
        while (!que.empty()){
            TreeNode* cur = que.front();
            que.pop();
            
            if (cur == nullptr){
                treeStr += ",null";
            } else {
                treeStr += ("," + to_string(cur->val));
                que.push(cur->left);
                que.push(cur->right);
            }
        }
        treeStr += "]";
        
        return treeStr;
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        vector<string> treeVec;
        queue<TreeNode*> que;
        TreeNode* tree = nullptr;
        
        spiltData(data, treeVec);    
        if (treeVec.empty()) return nullptr;
        
        for (int i = 0; i < treeVec.size(); i += 2){
            if (i == 0){
                tree = new TreeNode(stoi(treeVec[i]));
                que.push(tree);
            } else {
                TreeNode* cur = nullptr;
                if (treeVec[i] != "null"){
                    cur = new TreeNode(stoi(treeVec[i]));
                    que.push(cur);
                }
                que.front()->left = cur;
                
                cur = nullptr;
                if (i + 1 < treeVec.size() && treeVec[i+1] != "null"){
                    cur = new TreeNode(stoi(treeVec[i+1]));
                    que.push(cur);
                }
                que.front()->right = cur;
                
                que.pop();
            }
        }
        
        return tree;
    }
};

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