【剑指Offer】序列化二叉树

最新推荐文章于 2021-10-23 17:10:06 发布

fuqiuai

最新推荐文章于 2021-10-23 17:10:06 发布

阅读量329

点赞数 1

分类专栏：剑指Offer

本文链接：https://blog.csdn.net/fuqiuai/article/details/88241093

版权

剑指Offer 专栏收录该内容

66 篇文章 1 订阅

订阅专栏

题目链接：https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

题目描述

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

解决方法

/*
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) return "#";
        string r = to_string(root->val);
        r.push_back(',');
        char *left = Serialize(root->left);
        char *right = Serialize(root->right);
        char *ret = new char[strlen(left) + strlen(right) + r.size()];
        strcpy(ret, r.c_str());
        strcat(ret, left);
        strcat(ret, right);
        return ret;
    }
    
    TreeNode* Deserialize(char *str) {
        return decode(str);
    }
    TreeNode* decode(char *&str) {
        if(*str=='#'){
            str++;
            return NULL;
        }
        int num = 0;
        while(*str != ',')
            num = num*10 + (*(str++)-'0');
        str++;
        TreeNode *root = new TreeNode(num);
        root->left = decode(str);
        root->right = decode(str);
        return root;
    }
};