2022-5-11-序列化和反序列化二叉搜索树

449. 序列化和反序列化二叉搜索树

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/serialize-and-deserialize-bst
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 [可运行]取巧的方法，给出一个数组，结果是得到这个数组，我们当然不至于直接传地址，可以用层次遍历和前序遍历，先遍历一遍保存字符串，再从字符串重新构造。不过这样的话也就完全没有用到二叉搜索树的性质，是棵树都可以这样做。

/**
 * 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) {
        if (root == NULL) return "#";
        return to_string(root->val) + " " + serialize(root->left) + " " + serialize(root->right) + " ";
    }

    // 先序构造树
    TreeNode* createTreeByPreOrder(stringstream& ss){
        string tmp;
        ss>>tmp;
        if (tmp == "#") return NULL;
        TreeNode* root = new TreeNode(stoi(tmp));
        root->left = createTreeByPreOrder(ss);
        root->right = createTreeByPreOrder(ss);
        return root;        
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        stringstream ss(data);
        return createTreeByPreOrder(ss);
    }
};

// Your Codec object will be instantiated and called as such:
// Codec* ser = new Codec();
// Codec* deser = new Codec();
// string tree = ser->serialize(root);
// TreeNode* ans = deser->deserialize(tree);
// return ans;