treeapp.java

来自「用java实现二叉树的建立」· Java 代码 · 共 31 行

import java.io.*;
public class TreeApp
{
 public static void main(String[] args) throws IOException
 {
  Tree theTree = new Tree(); // 创建一个Tree类的实例
  int a[]=new int[20];
  int no;
  System.out.print("请确定该二叉树共有几个元素：");
  BufferedReader br1=new BufferedReader(new InputStreamReader(System.in));
  no=Integer.parseInt(br1.readLine());
  for(int i=0;i<no;i++)
  {
  	int n=i+1;
  	System.out.print("第"+n+"个元素：");
  	BufferedReader br2=new BufferedReader(new InputStreamReader(System.in));
  	a[i]=Integer.parseInt(br2.readLine());
  	theTree.insert(a[i]);
  }
  System.out.print("请输入根结点：");
  BufferedReader br3=new BufferedReader(new InputStreamReader(System.in));
  int key=Integer.parseInt(br3.readLine());
  Node found = theTree.find(key); // 
  if(found != null)
   System.out.println("Found the Node with key "+key);
  else
   System.out.println("Could not find node with key "+key);
  theTree.printTree();
 } 
}