zoukankan      html  css  js  c++  java
  • C# 递归生成树(无限级)

    调用

    T_SubClassItem dataSubClassItem = JsonConvert.DeserializeObject<T_SubClassItem>(str); //更改为所需数据源
    TreeNode root = new TreeNode();
    CreateTree(root, 0, dataSubClassItem);

    递归生成树

    public void CreateTree(TreeNode Node, int ParentId, T_SubClassItem SubClassItem)
    {
        if (ParentId == 0)
        {
            Node.Tag = SubClassItem.ID;
            Node.Text = SubClassItem.SubClassItem;
            tree.Nodes.Add(Node);
            CreateTree(Node, SubClassItem.ID, SubClassItem);
        }
        else
        {
            if (SubClassItem.children.Count != 0)
            {
                for (int i = 0; i < SubClassItem.children.Count; i++)
                {
                    TreeNode node = new TreeNode();
                    node.Tag = SubClassItem.children[i].ID;
                    node.Text = SubClassItem.children[i].SubClassItem;
                    CreateTree(node, Convert.ToInt32(SubClassItem.children[i].ParentId), SubClassItem.children[i]);
                    Node.Nodes.Add(node);
                }
            }
        }
    }
  • 相关阅读:
    zznuoj 2173 春天的英雄梦
    zznuoj 2171: 春天的致富梦
    zznuoj 2169: 春天的打水梦
    zznuoj 2168 大家好 我是水题
    西安赛打铁队检讨书
    B-number HDU
    Bomb HDU
    CodeForces
    1140
    Frequent Subsets Problem
  • 原文地址:https://www.cnblogs.com/chendongbky/p/6651248.html
Copyright © 2011-2022 走看看