(╯▽╰)
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
string s = "";
public:
string tree2str(TreeNode* t) {
if(!t) return s;
print(t);
return s.substr(1,s.size()-2);
}
void print(TreeNode* t)
{
if(!t) return;
s.push_back('(');
s = s+ to_string(t->val);
if(!t->left && t->right)
{
s = s+"()";
print(t->right);
}
else
{
print(t->left);
print(t->right);
}
s.push_back(')');
}
};