test.java

数据结构二叉树

import java.io.*;
public class test
{
   public static void main(String args[])
   {
      char[] c=new char[0];
      String string=new String();
      String str=new String();
      BinaryTree tree=new BinaryTree();
      Node[] node=new Node[0];
      Node temp;
      int j=0;
      int count=0,co=0,pos=0;
      char[] Ctemp=new char[0];
      for(;;)
      {
        System.out.print("Enter Several Words or Enter 'exit' to Exit: ");
            try{
                   BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
                   string=in.readLine();
                }catch(IOException e){}
                c=string.toCharArray();
                if(c[0]=='e'&&c[1]=='x'&&c[2]=='i'&&c[3]=='t') {  System.exit(0);}
                else
                {
                    for(int i=0;i<c.length;i++)
                    if(c[i]==' ')  count++;
                    node=new Node[count];
                    for(int i=0;i<count;i++)   
                    node[i]=new Node();
                    for(int i=0;i<c.length;i++)
                    {   
            
                        if(c[i]==' ') 
                        {
                            Ctemp=new char[i-j+1];
                            pos=j;
                            for(int m=0;m<i-pos;m++,j++)
                            Ctemp[m]=c[j];
                            str=str.valueOf(Ctemp);
                            node[co].setData(str);
                            co++;
                            j=i;
                        }
                    }
                    tree.initTree(node[0]);
                    for(int i=1;i<count;i++)
                    tree.insertNode(node[i]);
                    tree.inOrder(tree.getRoot());
                    System.out.println();
                }
            }
        }
}