TreeView递归添加节点详解

最新推荐文章于 2024-01-16 00:45:00 发布

codeofsea

最新推荐文章于 2024-01-16 00:45:00 发布

阅读量1.3k

点赞数

文章标签： string

本文链接：https://blog.csdn.net/codeofsea/article/details/1742959

版权

        /// <summary>
        /// 加载部门树
        /// </summary>
        private void RefreshTree()
        {
            trUser.Nodes.Clear();
            TreeNode node = new TreeNode();
            Common.Entities.BasDept rootDept = Common.BLL.BasDeptBll.Instance.RootDept;
            FillTree(rootDept, node);
            trUser.Nodes.Add(node);
        }
        /// <summary>
        /// 递归法填充树节点
        /// </summary>
        /// <param name="tempDept"></param>
        /// <param name="node"></param>
        private void FillTree(Common.Entities.BasDept tempDept, TreeNode node)
        {
            node.Text = tempDept.DeptName;
            node.Value = tempDept.DeptID;
            for (int i = 0; i < tempDept.ChildCollection.Count; i++)
            {
                Common.Entities.BasDept childDept = tempDept.ChildCollection[i];
                TreeNode childNode = new TreeNode();
                node.ChildNodes.Add(childNode);
                PopulateNode(childNode, tempDept.ChildCollection[i].DeptID);
                FillTree(childDept, childNode);
            }
        }
        /// <summary>
        /// 得到部门树下的人员。
        /// </summary>
        /// <param name="aNode"></param>
        private void PopulateNode(TreeNode node, string id)
        {
            Common.Entities.TList<Common.Entities.BasUser> userList = Common.BLL.BasUserBll.GetByDeptID(id);
            for (int j = 0; j < userList.Count; j++)
            {
                TreeNode childNode = new TreeNode();
                childNode.Text = userList[j].UserName;
                childNode.Value = userList[j].UserID.ToString();
                if (IsChecked(userList[j].UserID))
                {
                    childNode.Checked = true;
                }
                node.ChildNodes.Add(childNode);
            }
        }