即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

606. Construct String from Binary Tree

编程语言 u013055770 67℃ 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.

此题较为简单,采用递归的思想,看代码便容易理解

    string tree2str(TreeNode* t) {
        if (t == NULL) 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;
    }






转载请注明:CodingBlog » 606. Construct String from Binary Tree

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情