在Java面试中，经常会被考察的数据结构是哪些？

java面试常考的数据结构递归、排序、查找。 package mypackage; //利用递归方式解决汉诺塔问题 import java.io.*; class Hanoi { public static void anykey_f() { //按任一键即继续执行Function char tChar; System.out.println("\n Press any key to continue ..."); try { tChar=(char)System.in.read(); }catch(IOException e){} } //递归函数调用求汉诺塔之解 public static void HanoiTower(int n,char a,char b,char c){ if(n==1){ System.out.print("Move disk from" + a + " -> " + c + "\n"); }else { //将A上n-1个盘子借助C移动到B HanoiTower(n-1,a,c,b); System.out.print("Move disk from " + a + " -> " + c + "\n"); //将B上n-1个盘子借助A移动到C HanoiTower(n-1,b,a,c); } } public static void main(String args[]) { //主函数 DataInputStream in = new DataInputStream(System.in); String st=""; Hanoi obj=new Hanoi(); int n=0; char A='A', B='B', C='C'; System.out.print("-----Hanoi Tower Implementation-----\n"); //输入共有几个盘子在A柱子中 System.out.print("How many disks in A ? "); System.out.flush(); try { st=in.readLine(); }catch(IOException e){} try { n=Integer.valueOf(st).intValue(); }catch(NumberFormatException e){} if(n==0){ System.out.print("no disk to move\n"); } else obj.HanoiTower(n,A,B,C); anykey_f(); } }