【Leetcode】297. Serialize and Deserialize Binary Tree

题目地址：

https://leetcode.com/problems/serialize-and-deserialize-binary-tree/

序列化和反序列化二叉树。

可以按先序遍历的方式进行序列化和反序列化，可以递归做。注意要将空指针序列化为一个非数字的占位符，例如可以用#，同时要将不同节点之间用一个分隔符隔开，以便于区分不同的节点。代码如下：

class Codec {
 public:
  // Encodes a tree to a single string.
  string serialize(TreeNode* root) {
    if (!root) return "#";
    return to_string(root->val) + "," + serialize(root->left) + "," +
           serialize(root->right);
  }

  // Decodes your encoded data to tree.
  TreeNode* deserialize(string data) {
    stringstream ss(data);
    vector<string> v;
    for (string s; getline(ss, s, ',');) v.push_back(s);
    int idx = 0;
    return dfs(idx, v);
  }

  TreeNode* dfs(int& idx, vector<string>& v) {
    if (v[idx] == "#") {
      idx++;
      return nullptr;
    }
    TreeNode* root = new TreeNode(stoi(v[idx++]));
    root->left = dfs(idx, v);
    root->right = dfs(idx, v);
    return root;
  }
};

序列化和反序列化时间复杂度都为$O(n)$，空间$O(h)$。