LeetCode 606：Construct String from Binary Tree （c++）

一：题目分析

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.

二：解题思路

考点1：二叉树的先序遍历-可以采用递归的方式实现

考点2：字符串处理-左子树为空，“（）”不可以省略，右子树为空，“（）”可以省略

三：代码实现

方法一：

/**
 * 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:

    string PreorderTraversal(TreeNode *t){
        string s;
        
        s+=("("+to_string(t->val));  //将int转为字符串
       
        if((t->left==NULL) && (t->right==NULL))
            s+=(")");
        else if((t->left!=NULL) && (t->right==NULL))   
            s+=(PreorderTraversal(t->left)+")");
        else if((t->left==NULL) && (t->right!=NULL)) 
            s+=("()"+PreorderTraversal(t->right)+")");
        else
            s+=(PreorderTraversal(t->left)+PreorderTraversal(t->right)+")");             
        return s;            
        
    } 
    string tree2str(TreeNode* t) {
        string s;
        if(t==NULL)
            return s;
        //删除第一个（和最后一个）
        return PreorderTraversal(t).substr(1,PreorderTraversal(t).length()-2);//substr:字符串截取函数 1:起始位置，length()-2截取长度
    }};

方法二：

/**
 * 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:

    string tree2str(TreeNode* t) {
        string s;
        if(t==NULL)
            return "";
        //非空，输出顶点的值
        s+=to_string(t->val);
        //左子树非空
        if(t->left!=NULL)
            s+="("+tree2str(t->left)+")";
        //左子树为空，右子树非空
        if((t->left==NULL) && (t->right!=NULL))
            s+="()";
        if(t->right!=NULL)
            s+="("+tree2str(t->right)+")";
            
        return s;

    }
};