LeetCode-606. Construct String from Binary Tree

Description

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.

Example 1

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)".

Example 2

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

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

Explanation: Almost the same as the first example, 
except we can't omit the first parenthesis pair to break the one-to-one mapping relationship between 
the input and the output.

Solution 1(C++)

class Solution {
public:
    string tree2str(TreeNode* t) {
        string res;
        if(t==NULL) return res;
        else res+=to_string(t->val);
        if(t->left!=NULL){
            res+='('+tree2str(t->left)+')';
        } else { 
            if(t->right!=NULL){
                res+="()";
                res+='('+tree2str(t->right)+')';
                return res;
            }
            else return res;
        }
        if(t->right!=NULL){
            res+='('+tree2str(t->right)+')';
        }
        return res;
    }
};

Solution 2(C++)

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) + ")" : "");
    }
};

Solution 3(C++)

class Solution {
public:
    string tree2str(TreeNode* t) {
        if (!t) return "";
        string s = to_string(t->val);
        if (t->left)  s += "(" + tree2str(t->left) + ")";
        else if (t->right) s += "()";
        if (t->right) s += "(" + tree2str(t->right) + ")";
        return s;
    }
};

算法分析

解法一是我自己写的，解法二与解法三是别人的答案。很明显，我的结构复杂，代码繁多，当然这是要在程序分析中说的。其实这道题逻辑挺简单，二叉树做起来基本思路与链表一样。其实我的解法中有重复的地方就是判断完左子树为空后，再判断右子树的时候，如果右子树不为空，那么其实只需要给res加上一个”()”，但是后面要写判断右子树的情况。这样在判断完两个子树的情况之后，return一下就可以了。而不用像解法一中那样，return三次。

程序分析

学习解法二中多重；？三目运算符。当然，这样只是增加代码观赏性，但是我的解法一中确实有太多重复代码。所以最应该好好学习解法三。

除此之外，还有一个很坑爹的地方就是，我刚开始数字转换成字符用的是:

t->val+'0';

这样有很多限制，比如负数没办法，比如这只适合0~9，如果来个100就不行，所以正确的用法是使用to_string()函数。