题解 | #二叉树的序列化#

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};*/

#include <string>
class TreeToSequence {
 public:
  string toSequence(TreeNode* root) {
    if(!root) return "";
    return "(" + toSequence(root->left) + toSequence(root->right) + ")";
  }
};