android递归树形结构,c#通用递归生成无限层级树

public void LoopToAppendChildren(List all, NewsType curItem)

{

var subItems = all.Where(ee => ee.ParentId==curItem.Id).ToList();

curItem.children = new List();

curItem.children.AddRange(subItems);

foreach (var subItem in subItems)

{

LoopToAppendChildren(all, subItem);//新闻1.1

}

}

//通用 ParentId,Id,children 用了反射效率不高

public void LoopToAppendChildren(List all, T curItem, string parentIdName = "ParentId", string idName = "Id", string childrenName = "children")

{

var subItems = all.Where(ee => ee.GetType().GetProperty(parentIdName).GetValue(ee, null).ToString() == curItem.GetType().GetProperty(idName).GetValue(curItem, null).ToString()).ToList(); //新闻1

curItem.GetType().GetField(childrenName).SetValue(curItem, subItems);

foreach (var subItem in subItems)

{

LoopToAppendChildren(all, subItem);//新闻1.1

}

}

调用:

//实例化一个根节点

NewsType rootRoot = new NewsType();

rootRoot.Id = ;

rootRoot.ParentId = ;

rootRoot.Name="根节点";

LoopToAppendChildren(dc.NewsType.ToList(), rootRoot);