searchtest.java

1. 用二叉链表保存二叉树 2. 以基于二叉树的先序序列创建立二叉树 3. 按前序、中序、后序遍历二叉树（三选一）

class SearchTest{
	public static final int NUM=5;
	public static void main(String[] args)
	{
		System.out.println("顺序查找：");
		Search S=new Search();
		S.input();
		System.out.println("查找次数："+S.search());
		
		System.out.println("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
		System.out.println("二分查找：");
		HalfSearch H=new HalfSearch();
		H.input();
		System.out.println("查找次数："+H.search());
		
	}
}