定義一個樹形實體?

public class orgTrees{public orgTrees(){this.Children = new List<orgTrees>();}public int Id { get; set; }public int FatherId { get; set; }public string Name { get; set; }public int Lever { get; set; }public bool HasChildren { get; set; }public string OrgCode;public int OrgType;public List<orgTrees> Children { get; set; }}

開始遞歸方法

1 /// <summary> 2 /// 獲取組織層級樹 3 /// </summary> 4 /// <returns></returns> 5 public AjaxResponse<orgTrees> GetOrgTrees() 6 { 7 var list = new List<orgTrees>(); 8 var orgLayerList = _organizeProxy.ListOrgInfoForManage(); 9 10 var dic = new Dictionary<int, orgTrees>(orgLayerList.Count); 11 foreach (var item in orgLayerList) 12 { 13 dic.Add(item.Info.Id, new orgTrees 14 { 15 Id = item.Info.Id, 16 FatherId = item.Info.FatherId, 17 Name = item.Info.Name.GetValueByLanId(WorkContext.WorkingLanguage.Id), 18 Lever = item.Layer, 19 OrgCode = item.Info.OrgCode, 20 OrgType = item.Info.OrgType, 21 }); 22 } 23 24 //根節點 25 var rootNode = orgLayerList.Where(x => x.Info.FatherId.Equals(-1)).First(); 26 var model = new orgTrees(); 27 model.Id = rootNode.Info.Id; 28 model.FatherId = rootNode.Info.FatherId; 29 model.Name = rootNode.Info.Name.GetValueByLanId(WorkContext.WorkingLanguage.Id); 30 model.Lever = rootNode.Layer; 31 model.OrgCode = rootNode.Info.OrgCode; 32 model.OrgType = rootNode.Info.OrgType; 33 model.HasChildren = rootNode.HasChildren; 34 CreatTree(model.Id, model, orgLayerList); 35 return new AjaxResponse<orgTrees>(model); 36 } 37 //生成樹的方法 38 public void CreatTree(int parentId, orgTrees tree, LayerList<OrganizeInfo> laerList) 39 { 40 //獲取子節點 41 var childrenNode = laerList.ToList().FindAll(x => x.Info.FatherId == Convert.ToInt32(parentId)); 42 //如果沒有字節點了，那就返回空 43 if (childrenNode.Count == 0) return; 44 List<orgTrees> nodeTrees = new List<orgTrees>(); 45 for (int i = 0; i < childrenNode.Count; i++) 46 { 47 orgTrees node = new orgTrees(); 48 node.Id = childrenNode[i].Info.Id; 49 node.Name = childrenNode[i].Info.Name.GetValueByLanId(WorkContext.WorkingLanguage.Id); 50 node.FatherId = childrenNode[i].Info.FatherId; 51 node.Lever = childrenNode[i].Layer; 52 node.OrgCode = childrenNode[i].Info.OrgCode; 53 node.OrgType = childrenNode[i].Info.OrgType; 54 node.HasChildren = childrenNode[i].HasChildren; 55 //遞歸 56 CreatTree(childrenNode[i].Info.Id, node, laerList); 57 nodeTrees.Add(node); 58 } 59 tree.Children = nodeTrees; //由于對象是引用類型，因為可以改變參數的值 60 }

說下思路就是 先把根節點找出來，然后尋找根節點的子節點 然后遞歸循環子節點，尋找子節點的子節點

最后生成的是就是?

轉載于:https://www.cnblogs.com/dzhengyang/p/8515826.html

總結

以上是生活随笔為你收集整理的用递归形成树结构数据的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。