码迷,mamicode.com
首页 > 其他好文 > 详细

递归树形加载

时间:2016-07-04 13:27:19      阅读:212      评论:0      收藏:0      [点我收藏+]

标签:

public void AddTree(string ParentID, TreeNode pNode)
    {
        if (ds.Tables.Count > 0)
        {
            DataView dvTree = new DataView(ds.Tables[0]);
            //过滤ParentOrgID,得到当前的所有子节点   
            dvTree.RowFilter = "[IndexParentID]   =   ‘" + ParentID + "‘ and [StatusFlag]=‘1‘";
            foreach (DataRowView Row in dvTree)
            {
                TreeNode node = new TreeNode();
                if (pNode == null)
                {         //添加根节点   
                    node.Text = Row["IndexName"].ToString();
                    node.Value = Row["IndexID"].ToString();
                    TreeView1.Nodes.Add(node);
                    AddTree(Row["IndexID"].ToString(), node);         //再次递归   
                }
                else
                {       //添加当前节点的子节点   
                    node.Text = Row["IndexName"].ToString();
                    node.Value = Row["IndexID"].ToString();
                    pNode.ChildNodes.Add(node);
                    AddTree(Row["IndexID"].ToString(), node);         //再次递归   
                }
            }
            dvTree.Dispose();
            ds.Dispose();
        }

    }

递归树形加载

标签:

原文地址:http://www.cnblogs.com/HelloWenYuan/p/5639894.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!