前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Leetcode 297. Serialize and Deserialize Binary Tree

Leetcode 297. Serialize and Deserialize Binary Tree

作者头像
triplebee
发布2018-03-27 16:50:08
8480
发布2018-03-27 16:50:08
举报
文章被收录于专栏:计算机视觉与深度学习基础

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 tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.

For example, you may serialize the following tree

代码语言:javascript
复制
    1
   / \
  2   3
     / \
    4   5

as "[1,2,3,null,null,4,5]", just the same as how LeetCode OJ serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.

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

二叉树的序列化与反序列化。

其实就是通过某一种遍历方法将树变成序列存储,再将序列还原成树。用一个非数字的字符表示空节点,比如“#”

代码语言:javascript
复制
/**
 * 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:
    void dfs(string &path, TreeNode* root)
    {
        if(!root)
        {
            path += "#";
            return ;
        }
        path += to_string(root->val) + "#";
        dfs(path, root->left);
        dfs(path, root->right);
    }
    // Encodes a tree to a single string.
    string serialize(TreeNode* root) {
        string res;
        dfs(res, root);
        return res;
    }
    
    TreeNode* dfs2(string &data)
    {
        int pos = data.find("#");
        if(!pos)
        {
            data = data.substr(pos + 1);
            return NULL;
        }
        TreeNode* root = new TreeNode(stoi(data.substr(0, pos)));
        data = data.substr(pos + 1);
        root->left = dfs2(data);
        root->right = dfs2(data);
        return root;
    }
    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        string data2 = data;
        return dfs2(data2);
    }
};

// Your Codec object will be instantiated and called as such:
// Codec codec;
// codec.deserialize(codec.serialize(root));  
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
如有侵权请联系 cloudcommunity@tencent.com 删除

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

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

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

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