java 将数组存进二叉树中

封装treenode（包含value，left，right）
创建函数createtree

package apple;

import java.util.Scanner;

//import java.lang.*;

class Treenode{
	int value;
	Treenode left;
	Treenode right;
	Treenode(int n) {
		value=n;
		
	}
	
}

public class appl {

	
	
	public static Treenode createtree(Integer []arr,int index)
	{
		Treenode treenode=null;
		
		if(index<arr.length)
		{
			Integer a=arr[index];
			if(a==null) return null;
			else {
				treenode=new Treenode(a);
			}
			treenode.left=createtree(arr, index*2+1);
			treenode.right=createtree(arr, index*2+2);
			return treenode;
		}
		return treenode;
	}
	
	
	
	public static void main(String[] args) {
		
		// TODO Auto-generated method stua
		
		Integer []tree={1,2,3,4,null};
		Treenode treenode= createtree(tree,0);
		while(treenode.left!=null)
		{
			System.out.println(treenode.value);
			treenode=treenode.left;
		}
		
		
	}

}
```![在这里插入图片描述](https://img-blog.csdnimg.cn/20210118221745811.png)