本文共 716 字，大约阅读时间需要 2 分钟。

有一些博客构建出来的二叉树是完全二叉树，这篇博客什么样的二叉树都能构建

图为代码所示的一棵二叉树

public class BinaryTree {		private static String [] array = {"A","B","D","H","","","I","","","E","","J","","",			"C","F","","K","","","G","",""};	private static int arrayIndex = 0;	//	创建一棵二叉树，约定用户遵照前序遍历的方式输入数据//	不使用迭代是因为迭代必须要知道这棵树有多深，//	递归只需要输入就可以自行决定深度//	type:结点类型 0 根节点 1左孩子 2右孩子	public static TreeNode createBinaryTree(int type,String parentData) {		switch (type) {		case 0:			System.out.print("根节点:");			break;		case 1:			System.out.print(parentData+"的左孩子:");			break;		case 2:			System.out.print(parentData+"的右孩子:");			break;		}		//		可以使用手动输入也可以放到数组里//		Scanner sc = new Scanner(System.in);//		String data = sc.nextLine();				String data = "";		if(arrayIndex