Serialize and Deserialize Binary Tree -- leetcode

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.

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.

Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

解法， 对树进行前序遍历。即 根左右

一、迭代

/**
 * 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 {
public:

    // Encodes a tree to a single string.
    string serialize(TreeNode* root) {
        string ans;
        deque<TreeNode*> q;
        q.push_back(root);
        while (!q.empty()) {
            TreeNode *node = q.front();
            q.pop_front();
            if (node) {
                ans += to_string(node->val);
                ans += ",";
                
                q.push_back(node->left);
                q.push_back(node->right);
            }
            else {
                ans += "null,";
            }
        }
        
        if (!ans.empty())
            ans.pop_back();
        return ans;
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        istringstream ss(data);
        string token;
        
        TreeNode* root = NULL;
        deque<TreeNode**> q;
        q.push_back(&root);
        
        while (getline(ss, token, ',')) {
            TreeNode** node = q.front();
            q.pop_front();
            if (token == "null") {
                *node = NULL;
            }
            else {
                *node = new TreeNode(stoi(token));
                q.push_back(&(*node)->left);
                q.push_back(&(*node)->right);
            }
        }
        
        return root;
    }
};

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

二、递归

/**
 * 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 {
public:

    // Encodes a tree to a single string.
    string serialize(TreeNode* root) {
        ostringstream out;
        serialize(root, out);
        return out.str();
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        istringstream in(data);
        return deserialize(in);
    }
    
private:
    void serialize(TreeNode* root, ostringstream& out) {
        if (root) {
            out << root->val << ",";
            serialize(root->left, out);
            serialize(root->right, out);
        } else {
            out << "null,";
        }
    }
    
    TreeNode* deserialize(istringstream& in) {
        string word;
        getline(in, word, ',');
        if (word == "null")
            return NULL;
        
        TreeNode* root = new TreeNode(stoi(word));
        root->left = deserialize(in);
        root->right = deserialize(in);
        return root;
    }
};

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