序列化二叉树

题目：

请实现两个函数，分别用来序列化和反序列化二叉树

代码：

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    char* Serialize(TreeNode *root) {    
        if(root == nullptr)
            return "#";
        string str = to_string(root->val);
        str.push_back(',');
        char *left = Serialize(root->left);
        char *right = Serialize(root->right);

        char *ret = new char[strlen(left)+strlen(right)+str.size()+1];
        strcpy(ret, str.c_str());
        strcat(ret, left);
        strcat(ret, right);
        return ret;
    }
    TreeNode* decode(char* &str) //不能用一维指针，因为一维指针是复制，递归后，有返回原形了
    {
        if(*str == '#')
        {
            ++str;
            return nullptr;
        }
        int num = 0;
        while(*str != ',')
        {
            num = num * 10 + (*str - '0');
            ++str;
        }
        ++str;
        TreeNode* root = new TreeNode(num);
        root->left = decode(str);
        root->right = decode(str);
        return root;
    }
    TreeNode* Deserialize(char *str) {
        return decode(str);
    }
};