LeetCode 297 二叉树的序列化和反序列化

• 分析
  需要注意的是，一般情况下，**单单前序遍历是不能还原二叉树结构的，因为缺少空指针的信息，至少要得到前中后序遍历中的两种才能还原二叉树。但是我们可以记录空指针的位置，这样就可以唯一确定一棵二叉树（这是需要记住的）**后序遍历也可以完成，但是需要注意的是，中序遍历是不可以的，因为反序列化要求先拿到root节点，中序遍历做不到这一点。这道题目除了前后序遍历可以解决，层次遍历也是可以解决的。这里不写代码了（只需要注意，非空节点都由两个孩子即可（包括空的））。
• 代码

//前序遍历代码
class Codec {
public:

    // Encodes a tree to a single string.
    string serialize(TreeNode* root) {
        string sPre = "";
        traverse(root, sPre);
        return sPre;
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        vector<string> vec;
        
        int i = 0;
        int j = 0;
        int len = data.length();
        while(i < len){
            if(data[j] == ','){
                vec.push_back(data.substr(i, j - i));
                i = j + 1;
                j ++;
            }
            while(j < len && data[j] != ','){
                j++;
            }
        }
        TreeNode* root = deserialize(vec);
        return root;
    }

    int to_int(const string& s){
        int length = s.length();
        int number = 0;
        bool fu = true;
        for(int i = 0; i < length; i++){
            if(i == 0 && s[0] == '-') {
                fu = false;
                continue;
            }
            number = number * 10 + s[i] - 48;                        
        }
        if(!fu) return 0 - number;
        return number;
    }

    TreeNode* deserialize(vector<string>& vec){
        string s;
        if(vec.size() != 0){
            s = vec[0];
            vec.erase(vec.begin());
        }
        if(s == "#" || s == "") return nullptr;
        TreeNode* root = new TreeNode(to_int(s));

        root -> left = deserialize(vec);
        root -> right = deserialize(vec);
        return root;
    }

    void traverse(TreeNode* root, string& sPre){
        if(root == nullptr) {
            sPre = sPre + "#" + ",";
            return;
        }

        sPre += to_string(root -> val) + ",";
        traverse(root -> left, sPre);
        traverse(root -> right, sPre);
    }
};
//后序遍历代码如下：
class Codec {
public:

    // Encodes a tree to a single string.
    string serialize(TreeNode* root) {
        string post = "";
        posttraverse(root, post);
        return post;
    }

    void posttraverse(TreeNode* root, string& post){
        if(root == nullptr){
            post = post + "#" + ",";
            return;
        }

        posttraverse(root -> left, post);
        posttraverse(root -> right, post);

        post = post + to_string(root -> val) + ",";        
    }

    TreeNode* deserialize(string data) {
        list<string> lst;
        int i = 0;
        int j = 0;
        int len = data.length();
        while(i < len){
            if(data[j] == ','){
                lst.push_back(data.substr(i, j - i));
                i = j + 1;
                j ++;
            }
            while(j < len && data[j] != ','){
                j++;
            }
        }

        TreeNode* root = deserialize(lst);
        return root;        
    }

    TreeNode* deserialize(list<string>& lst){
        int size = lst.size();

        if(size == 0) return nullptr;
        if(lst.back() == "#"){
            lst.pop_back();
            return nullptr;
        }

        TreeNode* root = new TreeNode(to_int(lst.back()));
        lst.pop_back();

        root -> right = deserialize(lst);
        root -> left = deserialize(lst);
        return root;
    }

    int to_int(const string& s){
        int length = s.length();
        int number = 0;
        bool fu = true;
        for(int i = 0; i < length; i++){
            if(i == 0 && s[0] == '-') {
                fu = false;
                continue;
            }
            number = number * 10 + s[i] - 48;                        
        }
        if(!fu) return 0 - number;
        return number;
    }