package test;
public class TreeOperator {
private int value;
private TreeOperator left;
private TreeOperator right;
void StoreNode(int value){
if(this.value>value)
{
if(left==null)
{
left=new TreeOperator();
left.value=value;
}
else
{
left.StoreNode(value) ;
}
}
else{
if(right==null)
{
right=new TreeOperator();
right.value=value;
}
else
{
right.StoreNode(value);
}
}
}
public void prelist()
{
System.out.println(value);
if(left!=null)
left.prelist();
if(right!=null)
right.prelist();
}
public void midlist()
{
if(left!=null)
left.midlist();
System.out.println(value);
if(right!=null)
right.midlist();
}
public void nexlist()
{
if(left!=null)
left.nexlist();
if(right!=null)
right.nexlist();
System.out.println(value);
}
public static void main(String[] args)
{
int[] a=new int[20];
for(int i=0;i<20;i++)
a[i]=(int)(Math.random()*100);
TreeOperator node=new TreeOperator();
node.value=a[0];
for(int i=1;i<20;i++)
node.StoreNode(a[i]);
node.prelist();
System.out.println("**");
node.midlist();
System.out.println("**");
node.nexlist();
}
}
第一次用java实现建立二叉树。以前都是C++,居然忘记了
最新推荐文章于 2019-02-23 11:43:30 发布