[Leetcode从零开刷]606. Construct String from Binary Tree

题目来源：
leetcode
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way.

The null node needs to be represented by empty parenthesis pair “()”. And you need to omit all the empty parenthesis pairs that don’t affect the one-to-one mapping relationship between the string and the original binary tree.

翻译:
您需要构造一个字符串，该字符串由具有预序遍历的二叉树的括号和整数组成。
空节点需要用空括号对“()”来表示。您需要省略所有的空括号对，它们不会影响字符串和原始的二进制树之间的一对一映射关系，它们需要构造一个字符串，由带有预序遍历的二进制树的括号和整数组成。
例子：

Input: Binary tree: [1,2,3,4]
       1
     /   \
    2     3
   /    
  4     

Output: "1(2(4))(3)"

Explanation: Originallay it needs to be "1(2(4)())(3()())", 
but you need to omit all the unnecessary empty parenthesis pairs. 
And it will be "1(2(4))(3)".

Input: Binary tree: [1,2,3,null,4]
       1
     /   \
    2     3
     \  
      4 

Output: "1(2()(4))(3)"

题目意思，根据给出的二叉树，写一个对应的字符串。经过仔细看例子，
根节点直接返回
左节点若存在，则返回（左节点的值并字符串）若不存在，观察右节点存不存在
右节点存在，返回（），不存在返回空

class Solution {
public:
    string tree2str(TreeNode* t) {
        return !t? "":to_string(t->val)+ (t->left? "(" + tree2str(t->left) +")":t->right? "()":"") + 
                                            (t->right?  "(" + tree2str(t->right) + ")" :"");

    }
};