leetcode 606. Construct String from Binary Tree 前序遍历 + 深度优先遍历DFS-蒲公英云

leetcode 606. Construct String from Binary Tree 前序遍历 + 深度优先遍历DFS

水深无声 2022-06-02 21:13 258阅读 0赞

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.

本题题意很简单，就是遍历二叉树来添加括号，直接前序遍历即可

代码如下：

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <numeric>
#include <cmath>
#include <regex>
using namespace std;
/*
struct TreeNode
{
     int val;
     TreeNode *left;
     TreeNode *right;
     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
*/
class Solution
{
public:
    string tree2str(TreeNode* t)
    {
        if (t == NULL)
            return "";
        else
        {
            string res = to_string(t->val);
            string left = tree2str(t->left), right = tree2str(t->right);
            if (left == "" && right == "") 
                return res;
            if (left == "") 
                return res + "()" + "(" + right + ")";
            if (right == "") 
                return res + "(" + left + ")";
            return res + "(" + left + ")" + "(" + right + ")";
        }
    }
};