填充的TreeView与文件系统的目录结构

Question

我是新与节点这里.. :)我想出了这个算法，但它只能显示父节点列表..这样的..

a 
    a.txt 
    b 
    c 
c 
    m 
    n 
b 
    o 
    p 
etc... 

我想下一个节点将被放置在前面的节点..里面的节点之一，所以它会想出这样的..

a 
    a.txt 
    b 
     o 
     p 
    c 
     m 
     n 
etc... 

---

我心中有一个想法，但我可以把它落实代码。 。:)请任何帮助..

private void ListDirectory(TreeView treeView, String path) 
{    
    Stack<string> stack = new Stack<string>(); 
    TreeNode DirFilesCollection = new TreeNode(); 

    stack.Push(path);    

    while (stack.Count > 0) 
    { 
     string dir = stack.Pop(); 
     try 
     { 
      List<String> parentDir = new List<string>(); 
      parentDir.AddRange(Directory.GetFiles(dir, "*.*")); 
      parentDir.AddRange(Directory.GetDirectories(dir)); 

      DirectoryInfo d = new DirectoryInfo(dir); 
      TreeNode TParent = new TreeNode(d.Name); 

      foreach (String s in parentDir) 
      { 
       FileInfo f = new FileInfo(s); 
       TreeNode subItems = new TreeNode(f.Name); 

       TParent.Nodes.Add(subItems); 
      } 

      DirFilesCollection.Nodes.Add(TParent); 

      foreach (string dn in Directory.GetDirectories(dir)) 
      { 
       stack.Push(dn); 
      } 
     } 
     catch 
     {} 
    } 

    Action clearTreeView =() => treeView.Nodes.Clear(); 
    this.Invoke(clearTreeView); 

    Action showTreeView =() => treeView.Nodes.Add(DirFilesCollection); 
    this.Invoke(showTreeView); 
} 

Answer 1

选项＃1：递归的方法：

private void ListDirectory(TreeView treeView, string path) 
{ 
    treeView.Nodes.Clear(); 
    var rootDirectoryInfo = new DirectoryInfo(path); 
    treeView.Nodes.Add(CreateDirectoryNode(rootDirectoryInfo)); 
} 

private static TreeNode CreateDirectoryNode(DirectoryInfo directoryInfo) 
{ 
    var directoryNode = new TreeNode(directoryInfo.Name); 
    foreach (var directory in directoryInfo.GetDirectories()) 
     directoryNode.Nodes.Add(CreateDirectoryNode(directory)); 
    foreach (var file in directoryInfo.GetFiles()) 
     directoryNode.Nodes.Add(new TreeNode(file.Name)); 
    return directoryNode; 
} 

选项＃2：非递归的方法：

private static void ListDirectory(TreeView treeView, string path) 
{ 
    treeView.Nodes.Clear(); 

    var stack = new Stack<TreeNode>(); 
    var rootDirectory = new DirectoryInfo(path); 
    var node = new TreeNode(rootDirectory.Name) { Tag = rootDirectory }; 
    stack.Push(node); 

    while (stack.Count > 0) 
    { 
     var currentNode = stack.Pop(); 
     var directoryInfo = (DirectoryInfo)currentNode.Tag; 
     foreach (var directory in directoryInfo.GetDirectories()) 
     { 
      var childDirectoryNode = new TreeNode(directory.Name) { Tag = directory }; 
      currentNode.Nodes.Add(childDirectoryNode); 
      stack.Push(childDirectoryNode); 
     } 
     foreach (var file in directoryInfo.GetFiles()) 
      currentNode.Nodes.Add(new TreeNode(file.Name)); 
    } 

    treeView.Nodes.Add(node); 
}