jTree打造硬盘文件目录树

方案一：用递归遍历整个硬盘文件，并添加子节点

    可行度：底            原因：因为要遍历整个硬盘，速度很慢


方案二：在节点展开时动态添加子节点
   
    可行度：高            原因：弥补了方案一的缺陷

 

 

 

方案一的关键代码：  

 

private static final String []_root = {"A:","B:","C:","D:","E:","F:","G:",
                                          "H:","I:","J:","K:","L:","M:","N:",
                                          "O:","P:","Q:","R:","S:","T:","U:",
                                          "V:","W:","X:","Y:","Z:"};        
DefaultMutableTreeNode top = new DefaultMutableTreeNode("My Computer..."); ;
for(int i=0;i<_root.length;i++){
     File f = new File(_root[i]);
     if(f.isDirectory()){
           DefaultMutableTreeNode tempnode = new DefaultMutableTreeNode(_root[i]);
           top.add(tempnode);
           traversalNode(tempnode);  //遍历添加子节点
     }
}
jTree1 = new JTree(top);
public void traversalNode(DefaultMuta