首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Leetcode 449. Serialize and Deserialize BST

Leetcode 449. Serialize and Deserialize BST

作者头像
Tyan
发布2019-05-25 22:58:05
3430
发布2019-05-25 22:58:05
举报
文章被收录于专栏:SnailTyanSnailTyanSnailTyan

版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://cloud.tencent.com/developer/article/1433957

文章作者:Tyan

博客:noahsnail.com | CSDN | 简书

1. Description

2. Solution

  • First Version
/**
 * 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) {
            return "";
        }
        string str;
        inorder(root, str);
        return str;
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        if(data.empty()) {
            return NULL;
        }
        int pos = 0;
        return reconstruct(data, pos, INT_MIN, INT_MAX);
    }

private:
    void pushIntToString(string& str, int val) {
        char buffer[4];
        memcpy(buffer, &val, sizeof(int));
        for(int i = 0; i < sizeof(int); i++) {
            str.push_back(buffer[i]);
        }
    }


    void inorder(TreeNode* root, string& nodes) {
        if(!root) {
            return;
        }       
        pushIntToString(nodes, root->val);
        inorder(root->left, nodes);
        inorder(root->right, nodes);
    }


    TreeNode* reconstruct(const string& str, int& pos,int minValue, int maxValue) {
        if(pos >= str.size()) {
            return NULL;
        }
        int val = 0;
        memcpy(&val, &str[pos], sizeof(int));
        if(val < minValue || val > maxValue) {
            return NULL;
        }
        pos += sizeof(int);
        TreeNode* node = new TreeNode(val);
        node->left = reconstruct(str, pos, minValue, val);
        node->right = reconstruct(str, pos, val, maxValue);
        return node;
    }
};

// Your Codec object will be instantiated and called as such:
// Codec codec;
// codec.deserialize(codec.serialize(root));
  • Second Version
/**
 * 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) {
            return "";
        }
        ostringstream out;
        serialize(root, out);
        return out.str();
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        if(data.empty()) {
            return NULL;
        }
        vector<int> values;
        istringstream in(data);
        while(in) {
            string str;
            in >> str;
            if(str == "") {
                break;
            }
            values.push_back(stoi(str));
        }
        int pos = 0;
        return deserialize(values, pos, INT_MIN, INT_MAX);
    }

private:

    void serialize(TreeNode* root, ostringstream& out) {
        if(!root) {
            return;
        }       
        out << root->val << " ";
        serialize(root->left, out);
        serialize(root->right, out);
    }


    TreeNode* deserialize(vector<int>& values,int& pos, int minValue, int maxValue) {
        if(pos >= values.size()) {
            return NULL;
        }
        int val = values[pos];
        if(val < minValue || val > maxValue) {
            return NULL;
        }
        TreeNode* node = new TreeNode(val);
        pos++;
        node->left = deserialize(values, pos, minValue, val);
        node->right = deserialize(values, pos, val, maxValue);
        return node;
    }
};

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

Reference

  1. https://leetcode.com/problems/serialize-and-deserialize-bst/description/
本文参与 腾讯云自媒体分享计划,分享自作者个人站点/博客。
原始发表:2018年08月14日,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体分享计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • 1. Description
  • 2. Solution
  • Reference
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档