Description:

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:

For example, you may serialize the following tree

   1
   / \
  2   3
     / \
    4   5

as "[1,2,3,null,null,4,5]"
, just the same as how LeetCode OJ serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.

Link:

https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/

解題方法：

用層級(jí)遍歷來(lái)序列化
格式：1 2 3 null null 4 5，即用空格隔開(kāi)每個(gè)節(jié)點(diǎn)。
然后把每個(gè)節(jié)點(diǎn)壓入隊(duì)列，用一個(gè)bool變量來(lái)判斷當(dāng)前節(jié)點(diǎn)是不是一個(gè)右孩子節(jié)點(diǎn)，如果是右孩子，則把隊(duì)伍頭部的節(jié)點(diǎn)彈出。

Tips:

在反序列化時(shí)，可以用stringstream來(lái)分割字符串

Time Complexity：

O(N)

完整代碼：

class Codec 
{
public:

    // Encodes a tree to a single string.
    string serialize(TreeNode* root) 
    {
        if(!root)
            return "";
        queue<TreeNode*> Q;
        Q.push(root);
        vector<string> builder;
        string result;
        while(!Q.empty())
        {
            TreeNode* curr = Q.front();
            Q.pop();
            if(!curr)
            {
                builder.push_back("null");
                continue;
            }
            builder.push_back(std::to_string(curr->val));
            Q.push(curr->left);
            Q.push(curr->right);
        }
        while(builder[builder.size() - 1] == "null")
            builder.pop_back();
        for(string str: builder)
        {
            result += str;
            result += " ";
        }
        result.pop_back();
        return result;
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) 
    {
        vector<string> str;
        stringstream ss(data);
        string temp;
        while(ss>>temp) //用stringsteam通過(guò)空格來(lái)分割字符串
            str.push_back(temp);
        if(str.size() == 0)
            return NULL;
        TreeNode* root = new TreeNode(stoi(str[0]));
        queue<TreeNode*> Q;
        Q.push(root);
        bool isRight = false;
        for(int i = 1; i < str.size(); i++)
        {
            if(str[i] != "null")
            {
                TreeNode* curr = new TreeNode(stoi(str[i]));
                if(isRight)
                    Q.front()->right = curr;
                else
                    Q.front()->left = curr;
                Q.push(curr);
            }
            if(isRight)
                Q.pop();
            isRight = !isRight;
        }
        return root;
    }
};