C++ 解法, 执行用时: 3ms, 内存消耗: 556KB, 提交时间: 2022-05-06

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

class TreeToSequence {
public:
    string toSequence(TreeNode* root) {
        // write code here
        string res;
        if(!root)
            return res;
        res = '(' + toSequence(root->left)+ toSequence(root->right) +')';
        return res;
    }
};

C++ 解法, 执行用时: 3ms, 内存消耗: 556KB, 提交时间: 2022-02-11

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

class TreeToSequence {
public:
    string toSequence(TreeNode* root) {
        // write code here
        if(!root) return "";
        return "("+toSequence(root->left)+toSequence(root->right)+")";
    }
};