private void Loadbook()
{
treeView1.Nodes.Clear();
IEnumerable<ContruduceBook> list = new ContruduceBookBLL().GetContuduceBookbyParentId(0);
foreach (ContruduceBook item in list)
{
TreeNode treenode = new TreeNode();
treenode.Text = item.Publisher;
treenode.Tag = item;
treeView1.Nodes.Add(treenode);
FillChildNode(treenode, item.Id.Value);
}
}
/// <summary>
/// 递归算法加载到treeview 中
/// </summary>
/// <param name="parenttreenode"></param>
/// <param name="parentId"></param>
private void FillChildNode(TreeNode parenttreenode, int parentId)//递归算法,深度遍历
{
IEnumerable<ContruduceBook> list = new ContruduceBookBLL().GetContuduceBookbyParentId(parentId);
foreach (ContruduceBook item in list)
{
TreeNode treenode = new TreeNode();
treenode.Text = item.Publisher;
treenode.Tag = item;
parenttreenode.Nodes.Add(treenode);
}
}
treeview 加载数据的递归代码
最新推荐文章于 2023-04-22 16:22:07 发布