题目描述:
编一个程序,读入用户输入的一串先序遍历字符串,根据此字符串建立一个二叉树(以指针方式存储)。 例如如下的先序遍历字符串: ABC##DE#G##F### 其中“#”表示的是空格,空格字符代表空树。建立起此二叉树以后,再对二叉树进行中序遍历,输出遍历结果。
public class TreeBuild {
static class TreeNode{
public char val;
public TreeNode left;
public TreeNode right;
public TreeNode (char val){
this.val = val;
}
}
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
while(scanner.hasNext()){
String line = scanner.next();
TreeNode root = buildTree(line);//line是一组先序遍历的结果 带#
inOrder(root);
System.out.println();
}
}
static int index = 0;
public static TreeNode buildTree(String line){
index = 0;//记录当前递归访问到字符串的第几个元素
return createTreePreOrder(line);
}
//这个辅助函数来完成递归
public static TreeNode createTreePreOrder(String line){
char c = line.charAt(index);
if(c == '#'){
return null;
}
TreeNode root = new TreeNode(c);
index++;
root.left = createTreePreOrder(line);
index++;
root.right = createTreePreOrder(line);
return root;
}
public static void inOrder(TreeNode root){
if(root == null){
return;
}
inOrder(root.left);
System.out.print(root.val+"");
inOrder(root.right);
}
}