public static void main(String[] args) {

File file = new File(“E:\\学习文档”);

treeShow(file, 0);

}

/**

* 用递归的方法打印一个文件夹的树形结构

* deep为递归的深度

*/

public static void treeShow(File file,int deep){

File[] files = file.listFiles();

StringBuilder sb = new StringBuilder();

for(int i=0;i<deep;i++){

sb.append(“—“);

}

for (File f : files) {

if(f.isFile()){

System.out.println(sb+f.getName());

}else if(f.isDirectory()){

System.out.println(sb+f.getName());

treeShow(f, ++deep);

deep–;

}

}

}