LeetCode学习笔记(8) 第297题 Serialize and Deserialize Binary Tree

题目

分析

采用先序遍历的方式存储成字符串， 当叶子节点左右子树为空的时候 我们使用#代替

流程

使用字符串输入输出流（istringstream, ostringstream）负责写入写出。

代码

c++版

/**
 * 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) {
        ostringstream out;
        serialize(root, out);
        return out.str();
    }

    // Decodes your encoded data to tree.
    TreeNode* deserialize(string data) {
        istringstream in(data);
        return deserialize(in);
    }
private:
    void serialize(TreeNode* root, ostringstream& out){
        if(!root)
        {
            out << "# ";
            return;
        }
        out << root->val <<" ";
        serialize(root->left, out);
        serialize(root->right, out);
    }
    TreeNode* deserialize(istringstream& in){
        string val;
        in >> val;
        if(val == "#") return nullptr;
        TreeNode* root = new TreeNode(stoi(val));
        root->left = deserialize(in);
        root->right = deserialize(in);
        return root;
    }
};

python版

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Codec:

    def serialize(self, root):
        """Encodes a tree to a single string.
        
        :type root: TreeNode
        :rtype: str
        """
        def dfs(root):
            if root is None:
                path.append('#')
            else:
                path.append(str(root.val))
                dfs(root.left)
                dfs(root.right)
        path = []
        dfs(root)
        return ' '.join(path)
        

    def deserialize(self, data):
        """Decodes your encoded data to tree.
        
        :type data: str
        :rtype: TreeNode
        """
        data_val = iter(data.split())
        def decode(value):
            val = next(value)
            if val == '#':
                return None
            root = TreeNode(val)
            root.left = decode(value)
            root.right = decode(value)
            
            return root
        return decode(data_val)
        
        

# Your Codec object will be instantiated and called as such:
# ser = Codec()
# deser = Codec()
# ans = deser.deserialize(ser.serialize(root))