C#多叉树问题

foreach (OF_Area area1 in areaManager.GetAreasByPAreaID(0))
        {
            TreeNode node1 = new TreeNode();
            node1.Text = area1.AreaName;
            node1.Value = area1.AreaID.ToString();
            foreach (OF_Area area2 in areaManager.GetAreasByPAreaID(area1.AreaID))
            {
                TreeNode node2 = new TreeNode();
                node2.Text = area2.AreaName;
                node2.Value = area2.AreaID.ToString();
                foreach (OF_Area area3 in areaManager.GetAreasByPAreaID(area2.AreaID))
                {
                    TreeNode node3 = new TreeNode();
                    node3.Text = area3.AreaName;
                    node3.Value = area3.AreaID.ToString();
                    node2.ChildNodes.Add(node3);
                }
                node1.ChildNodes.Add(node2);
            }
            tvArea.Nodes.Add(node1);
        }

将以上代码改成递归

void Fill(TreeNodeCollection nodes,int id)
{
    foreach(OF_Area item in areaManager.GetAreasByPAreaID(id)
    {
    TreeNode node= new TreeNode();    
    node.Text=item.AreaName;
    node.Value=item.AreaID.ToString();
    
    Fill(node.Nodes,item.AreaID);
    nodes.Add(node);//如果运行有错的话,你就得把它与上一行交换一下顺序
    }
}

//调用
Fill(tvArea.Nodes,0);

举例给你讲解

二叉树左子树递归便利思路如下：

 public void foreachTree(TreeNode){

   //做节点是否为父节点

    if(left.TreeNode!=null){//是父节点的话，继续到下一层判断

    foreachTree(left.TreeNode);

    }else//非，输出节点

    syso("输出该节点")

}