zoukankan      html  css  js  c++  java
  • treeview的遍历

     

     if (this.TreeView_areaList.SelectedNode.ChildNodes.Count == 0)//为叶子节点时
            {
                string value = this.TreeView_areaList.SelectedNode.Value;
            }
            else if (this.TreeView_areaList.SelectedNode.Text == "组织机构")//为根节点时
            {
            }
            else//为中间节点时
            {
                ArrayList alist = findtreenode(this.TreeView_areaList.SelectedNode);
            }

    递归找出选中节点的所有叶子节点,放到动态数组中,用这些数据进行查询,有些慢,但不知道还有没有其他方法了。

    public ArrayList findtreenode(TreeNode tnc)//递归查找选定节点的所有叶子节点
        {
            foreach (TreeNode node in tnc.ChildNodes)
            {
                if (node.ChildNodes.Count != 0)
                {

                    findtreenode(node);
                }
                else
                {
                    ar.Add(node.Value);//在叶子节点设置其NavigateUrl
                }
            }
            return ar;
        }

     

     

       

  • 相关阅读:
    leetcode-easy-string-28 Implement strStr()
    leetcode-easy-string-242. Valid Anagram
    leetcode-easy-string-387 First Unique Character in a String
    指派问题(匈牙利算法)
    Neural Network Basics
    Softmax && Cross-entropy Error
    Our Future
    SVD
    Lecture2
    RF 和 GBDT联系和区别
  • 原文地址:https://www.cnblogs.com/hu88oo/p/1327497.html
Copyright © 2011-2022 走看看