这个是一个循环树,下面给你我写的实例:
for (int i = 0; i < dsdoc.Tables[0].Rows.Count; i++)//找出所有父节点
                        {
                            TreeNode node = new TreeNode();
                            node.Text = dsdoc.Tables[0].Rows[i]["teamname"].ToString();
                            node.Value = dsdoc.Tables[0].Rows[i]["teamid"].ToString();
                            node.ImageUrl = Config.teamPic;
                            treenode(node);   //调用循环查找的方法
                            TreeView1.Nodes.Add(node);
                        }

public void treenode(TreeNode parnetnode)//循环遍历viewcity的子节点
    {
        string teamid = parnetnode.Value;
        DataSet ds = Docment.getdoc(teamid);
        if (ds.Tables[0].Rows.Count > 0)
        {
            for (int i = 0; i < ds.Tables[0].Rows.Count; i++)
            {
                TreeNode childnode = new TreeNode();
                childnode.Text = ds.Tables[0].Rows[i]["docname"].ToString();
                childnode.Value = ds.Tables[0].Rows[i]["id"].ToString();
                childnode.ImageUrl = Config.docPic;
                parnetnode.ChildNodes.Add(childnode);
            }
        }
        else
        {
            return;
        }
    }
看不懂再问

相关文章:

  • 2022-12-23
  • 2022-02-08
  • 2021-07-01
  • 2021-10-09
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2021-07-23
猜你喜欢
  • 2021-06-29
  • 2022-12-23
  • 2021-08-09
  • 2021-12-04
  • 2022-01-05
  • 2022-12-23
相关资源
相似解决方案