数据结构--创建二叉树

通过录入一个前序排列的结构，生成二叉树结构，java代码实现

根据文章中描述的二叉树，用java代码生成。

/**
 * 前序排列的二叉树：AB#D###C##
 * 
 * @author zm
 * 
 */
public class Tree {
	public static String str = "A,B,#,D,#,#,#,C,#,#";
	public static String[] strs;
	public static int count;

	public static TreeNode createTree() {
		if ("#".equals(strs[count++])) {
			return null;
		}
		TreeNode tree = new TreeNode(strs[count - 1]);
		tree.lTree = createTree();
		tree.rTree = createTree();
		return tree;
	}

	public static void main(String args[]) {
		strs = str.split(",");
		TreeNode t = createTree();
		System.out.println("========");
	}
}

class TreeNode {
	public String date;
	TreeNode lTree;
	TreeNode rTree;

	public TreeNode(String str) {
		this.date = str;
	}
}