C# Net 树帮助类，树节点帮助类（非递归）

C# Net 树帮助类

C# Net 树节点帮助类

优点：非递归，效率可能更高

 

------------------------------------------------------------

------------------------------------------------------------

---------------------文尾看调用方式------------------

------------------------------------------------------------

------------------------------------------------------------

 

创建一个新的文件 TreeNodeHelper.cs 并拷贝代码：

 

    /// <summary>
    /// 树节点
    /// </summary>
    public class TreeNodeHelper
    {
        /// <summary>
        /// 初始化树节点
        /// </summary>
        public TreeNodeHelper()
        {
            Children = new List<object>();
        }

        /// <summary>
        /// 名称
        /// </summary>
        public string Name { get; set; }
        /// <summary>
        /// 主键Id
        /// </summary>
        public object Id { get; set; }
        /// <summary>
        /// 父Id
        /// </summary>
        public object Pid { get; set; }
        /// <summary>
        /// 子节点
        /// </summary>
        public List<object> Children { get; set; }
    }

    /// <summary>
    /// 树节点扩展
    /// </summary>
    public static class TreeNodeExHelper
    {
        /// <summary>
        /// 转为树结构
        /// </summary>
        /// <param name="treeNodes">树节点</param>
        /// <returns>树节点带子节点（Children）</returns>
        public static List<T> ToTree<T>(this List<T> treeNodes) where T : TreeNodeHelper
        {
            if (treeNodes == null || !treeNodes.Any())
                return treeNodes;
            if (treeNodes.Any(o => o.Id == o.Pid))
                throw new Exception("存在id和pid相同的数据，无限循环引用");

            var group = treeNodes.GroupBy(x => x.Pid).ToDictionary(x => x.Key, s => s.ToList());

            foreach (var item in treeNodes)
            {
                if (group.ContainsKey(item.Id))
                {
                    var treeNode = group[item.Id];
                    if (treeNode.Any(o => o.Id == item.Pid && o.Pid == item.Id))
                        throw new Exception("存在id和pid交叉引用(如：{Id='我是你',Pid='你是我'} 和 {Id='你是我',Pid='我是你'})");

                    item.Children.AddRange(treeNode);
                }
            }

            //查找顶级节点
            var ids = treeNodes.Select(o => o.Id).Distinct();
            var pids = treeNodes.Select(o => o.Pid).Distinct();
            var c = pids.Except(ids);
            return group.Where(o => c.Contains(o.Key)).SelectMany(o => o.Value).ToList();
        }

        /// <summary>
        /// 将指定的id节点转为树结构
        /// </summary>
        /// <param name="treeNodes">树节点</param>
        /// <param name="id">id节点</param>
        /// <returns>树节点带子节点（Children）</returns>
        public static T ToTree<T>(this List<T> treeNodes, object id) where T : TreeNodeHelper
        {
            if (treeNodes == null)
                return null;
            if (!treeNodes.Any())
                return treeNodes.FirstOrDefault();
            if (treeNodes.Any(o => o.Id == o.Pid))
                throw new Exception("存在id和pid相同的数据，无限循环引用");

            var group = treeNodes.GroupBy(x => x.Pid).ToDictionary(x => x.Key, s => s.ToList());

            foreach (var item in treeNodes)
            {
                if (group.ContainsKey(item.Id))
                {
                    var treeNode = group[item.Id];
                    if (treeNode.Any(o => o.Id == item.Pid && o.Pid == item.Id))
                        throw new Exception("存在id和pid交叉引用(如：{Id='我是你',Pid='你是我'} 和 {Id='你是我',Pid='我是你'})");

                    item.Children.AddRange(treeNode);
                }
            }

            return treeNodes.FirstOrDefault(o => o.Id == id);
        }
    }

树节点帮助类