LeetCode #449 - Serialize and Deserialize BST

最新推荐文章于 2022-03-07 13:27:43 发布

LawFile

最新推荐文章于 2022-03-07 13:27:43 发布

阅读量95

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/LawFile/article/details/86672782

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文介绍了一种将二叉搜索树序列化为字符串，并能从该字符串反序列化回原始树结构的算法。序列化过程通过递归遍历树节点，将节点值转换为字符串。反序列化则利用istringstream读取字符串，重建二叉搜索树。算法确保了状态无依赖，且输出字符串紧凑。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述：

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

Design an algorithm to serialize and deserialize a binary search tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary search tree can be serialized to a string and this string can be deserialized to the original tree structure.

The encoded string should be as compact as possible.

Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

class Codec {
public:

    // Encodes a tree to a single string.
    string serialize(TreeNode* root) {
        if(root==NULL) return "#/";
        string left=serialize(root->left);
        string right=serialize(root->right);
        string result=to_string(root->val)+"/"+left+right;
        return result;
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        istringstream iss(data);
        return helper(iss);
    }
    
    TreeNode* helper(istringstream& iss)
    {
        string temp;
        getline(iss,temp,'/');
        if(temp=="#") return NULL;
        TreeNode* root=new TreeNode(atoi(temp.c_str()));
        root->left=helper(iss);
        root->right=helper(iss);
        return root;
    }
};