大家好，又见面了，我是你们的朋友全栈君。
question:
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.
分析：
先根遍历
try:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { public String tree2str(TreeNode t) { StringBuilder sb = new StringBuilder(); pre_orderVisit(t,sb); return sb.toString(); } public void pre_orderVisit(TreeNode t,StringBuilder sb){ if(t==null){ return; } sb.append(t.val); if(t.left==null&&t.right==null){ return; } sb.append("("); pre_orderVisit(t.left,sb); sb.append(")"); if(t.right!=null){ sb.append("("); pre_orderVisit(t.right,sb); sb.append(")"); } } }
result:
conclusion:
转载于:https://www.cnblogs.com/hzg1981/p/8970387.html
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/107553.html原文链接：https://javaforall.net
