码迷,mamicode.com
首页 > 其他好文 > 详细

Construct String From Binary Tree

时间:2017-06-09 13:17:26      阅读:123      评论:0      收藏:0      [点我收藏+]

标签:turn   amp   style   order   binary   bre   -o   const   put   

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.
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 public class Solution {
11     public String tree2str(TreeNode t) {
12         if (t == null) return "";
13         if (t.left == null && t.right == null) return String.valueOf(t.val);
14         
15         String leftStr = tree2str(t.left);
16         String rightStr = tree2str(t.right);
17         
18         if (t.left == null) return t.val + "()(" + rightStr + ")";
19         if (t.right == null) return t.val + "(" + leftStr + ")";
20         return t.val + "(" + leftStr + ")(" + rightStr + ")";
21     }
22 }

 

Construct String From Binary Tree

标签:turn   amp   style   order   binary   bre   -o   const   put   

原文地址:http://www.cnblogs.com/amazingzoe/p/6971489.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!