1
我有一个我想要转换为树结构的列表。我怎样才能将其转换为树状结构?使用c#递归地构建父子关系的树
我已经看过Build tree type list by recursively checking parent-child relationship C#线程,但由于我班的键是字符串,我无法使用该解决方案。请帮助
internal class Program
{
private static void Main(string[] args)
{
List<node> nodeList = new List<node>();
node n = new node("A", "A1", null, 1); nodeList.Add(n);
n = new node("B", "A2", "A1", 2); nodeList.Add(n);
n = new node("C", "A3", "A1", 2); nodeList.Add(n);
n = new node("D", "A4", "A1", 2); nodeList.Add(n);
n = new node("E", "A5", "A2", 3); nodeList.Add(n);
n = new node("F", "A6", "A5", 4); nodeList.Add(n);
n = new node("G", "A7", "A3", 3); nodeList.Add(n);
n = new node("H", "A8", "A4", 3); nodeList.Add(n);
n = new node("I", "A9", "A4", 3); nodeList.Add(n);
n = new node("J", "A10", "A4", 3); nodeList.Add(n);
n = new node("K", "A11", "A10", 4); nodeList.Add(n);
n = new node("L", "A12", "A10", 4); nodeList.Add(n);
n = new node("M", "A13", "A12", 5); nodeList.Add(n);
n = new node("N", "A14", "A12", 5); nodeList.Add(n);
n = new node("O", "A15", "A10", 4); nodeList.Add(n);
n = new node("P", "A16", null, 1); nodeList.Add(n);
n = new node("Q", "A17", "A16", 2); nodeList.Add(n);
}
}
public class node
{
public string name { get; set; }
public string key { get; set; }
public string parentKey { get; set; }
public int level { get; set; }
public List<node> Children { get; set; }
public node(string Name, string Key, string PK, int Level)
{
name = Name;
key = Key;
parentKey = PK;
level = Level;
}
}
反向链接树是硬(ISH)解析成羽翼丰满的大树。无法在单个线性传递中完成,您需要首先将节点存储在关联容器中,然后在第二次传递中构建边... – Medinoc