Java 数组构建二叉树「建议收藏」

大家好，欢迎来到IT知识分享网。

二叉树ADT(abstract data type)：

二叉树节点类：

class TreeNode{
		int value;
		TreeNode left;
		TreeNode right;
		
		public TreeNode(int paraValue) 
		{
			this.value = paraValue;
		}
	}

二叉树类：

public class BinaryTree {
	
  TreeNode root;
  class TreeNode{
		int value;
		TreeNode left;
		TreeNode right;
		
		public TreeNode(int paraValue) 
		{
			this.value = paraValue;
		}
	}
	
    public BinaryTree(int[]array)
    {
    	root = createBinaryTreeByArray(array, 0);
    }
  
	private TreeNode createBinaryTreeByArray(int []array,int index)
	{
	    TreeNode tn = null;
		if (index<array.length) {
			    int value = array[index];
				tn = new TreeNode(value);
				tn.left = createBinaryTreeByArray(array, 2*index+1);
				tn.right = createBinaryTreeByArray(array, 2*index+2);
				return tn;
			}		
		return tn;
	}