zoukankan      html  css  js  c++  java
  • 无限数据递归

    protected void Page_Load(object sender, EventArgs e)
            {
                if (!Page.IsPostBack)
                {
                  AddTree(0, (TreeNode)null);
                }
            }
            protected void AddTree(int parentId, TreeNode pNode)
            {

                PurviewPage[] purviewPageList = BLL.PurviewPageBLL.GetDataByParentId(parentId);
                for(int i=0;i<purviewPageList.Length;i++)
                {
                    TreeNode Node = new TreeNode();
                    if (pNode == null)
                    {
                        //添加根节点
                        Node.Text = purviewPageList[i].Name;
                        Node.Value = purviewPageList[i].ID.ToString() ;
                        Node.NavigateUrl = Request.Url.AbsoluteUri.Replace(BLL.PurviewPageBLL.getUrl(Request.RawUrl), "") + purviewPageList[i].Url;
                        TreeView1.Nodes.Add(Node);
                        Node.Expanded = true;
                        AddTree(purviewPageList[i].ID, Node); //再次递归
                    }
                    else
                    {
                        //?添加当前节点的子节点
                        Node.Text = purviewPageList[i].Name;
                        Node.Value = purviewPageList[i].ID.ToString();
                        Node.NavigateUrl = Request.Url.AbsoluteUri.Replace(BLL.PurviewPageBLL.getUrl(Request.RawUrl), "") + purviewPageList[i].Url;
                        pNode.ChildNodes.Add(Node);
                        Node.Expanded = true;
                        AddTree(purviewPageList[i].ID, Node); //再次递归
                    }
                }
            }

  • 相关阅读:
    HDU Ignatius and the Princess III (母函数)
    HDU 1014 Uniform Generator
    HDU 1013 Digital Roots
    HDU u Calculate e
    HDU 1005 Number Sequence 找规律
    Vijos 送给圣诞夜的极光(bfs)
    HDU Sum Problem (一道神坑的水题)
    Vijos CoVH之再破难关(搜索+hash)
    VIjos 晴天小猪历险记之Number (搜索+链表hash)
    Vijos 有根树的同构问题【字符串---最小表示法】
  • 原文地址:https://www.cnblogs.com/skyblue/p/955027.html
Copyright © 2011-2022 走看看