/**
* 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 {
public:
void pre(TreeNode* t,string &res)
{
if(t==NULL)return;
res+=to_string((t->val));
if(t->left==NULL&&t->right==NULL)
return;
else{
res+='(';
pre(t->left,res);
res+=')';
if(t->right!=NULL){
res+='(';
pre(t->right,res);
res+=')';
}
}
}
string tree2str(TreeNode* t) {
string res;
pre(t,res);
return res;
}
};