zoukankan      html  css  js  c++  java
  • 20161011001 treeView 递归

    protected void FillTree()
            {
                H_data H_data = new H_data();

                H_data.sql_text1 = " select [FID],[N_Name],[N_Parent_ID] FROM [PLM].[dbo].[T_Sys_File_Tree] ";
                H_data.select_tables();
                DataSet1 = H_data.DataSet8;
                DataTable dt = DataSet1.Tables[0];
                //this.dataGridView1.DataSource = dt;

                NodeLoad(0, null);
            }
            private void NodeLoad(int parentId, TreeNode upNode)
            {
                DataView dv = new DataView(DataSet1.Tables[0]);
                dv.RowFilter = string.Format("N_Parent_ID = {0}", parentId);
                foreach (DataRowView drv in dv)
                {
                    if (upNode == null)
                    {
                        TreeNode newNode = this.treeView1.Nodes.Add(drv[1].ToString());
                        newNode.Tag = drv[0].ToString();
                        NodeLoad(Int32.Parse(drv[0].ToString()), newNode);
                        newNode.Expand();
                    }
                    else
                    {
                        TreeNode newNode = upNode.Nodes.Add(drv[1].ToString());
                        newNode.Tag = drv[0].ToString();
                        NodeLoad(Int32.Parse(drv[0].ToString()), newNode);
                        newNode.Expand();
                    }
                }

                //展开组件中的所有节点
                //treeView1.SelectedNode.ExpandAll();
                //定位根节点
                //treeView1.SelectedNode = treeView1.Nodes[0];
                treeView1.SelectedNode = null;
            }

  • 相关阅读:
    构建之法读书笔记04
    团队冲刺06
    12.23——周总
    团队冲刺05
    团队冲刺04
    用户场景分析
    团队冲刺03
    返回一个二维数组中最大联通子数组的和
    团队冲刺02
    FFT/NTT基础题总结
  • 原文地址:https://www.cnblogs.com/hutie1980/p/5949479.html
Copyright © 2011-2022 走看看