思路:借助队列
import java.util.*;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}*/
public class TreeToSequence {
public String toSequence(TreeNode root) {
// write code here
StringBuilder stringBuilder = new StringBuilder();
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()) {
TreeNode node = queue.poll();
stringBuilder.append("(");
if (node.left != null) {
stringBuilder.append(toSequence(node.left));
}
if (node.right != null) {
stringBuilder.append(toSequence(node.right));
}
stringBuilder.append(")");
}
return stringBuilder.toString();
}
}
解法2:不用队列,注意左子树开始前加“(”,右子树结束后加“)”
import java.util.*;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}*/
public class TreeToSequence {
public String toSequence(TreeNode root) {
// write code here
StringBuilder stringBuilder = new StringBuilder();
stringBuilder.append("(");
if (root.left != null) {
stringBuilder.append(toSequence(root.left));
}
if (root.right != null) {
stringBuilder.append(toSequence(root.right));
}
stringBuilder.append(")");
return stringBuilder.toString();
}
}