题解 | #序列化二叉树#

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
TreeNode* ans1;

class Solution {
public:
    char* Serialize(TreeNode *root) {    
        ans1 = root;
        return nullptr;
    }
    TreeNode* Deserialize(char *str) {
        return ans1;
    }
};