C#树形递归实现.pdfVIP

C#树形递归实现

数据据库结构：

idsubjectnameparentid

C#实现代码：

StringBuilderhtml=newStringBuilder();

protectedvoidPage_Load(objectsender,EventArgse)

{

DataTabledt=getTable(SELECT[Id],[subjectname],[ParentId]FROM[FileTree]);

if(dt.Rows.Count0)

{

DataRow[]dr=dt.Select(parentid=0);

for(inti=0;idr.Length;i++)

{

//html.Append(dr[i][subjectname]+dr[i][id].ToString()+);

html.Append(dr[i][subjectname]+dr[i][id].ToString()+);

CreateChildNode(dr[i][id].ToString(),dt);

//html.Append();

}

}

Response.Write(html.ToString());

}

privatevoidCreateChildNode(stringparentNode,DataTabledt)//创建孩⼦节点

{

DataRow[]rows=dt.Select(parentid=+parentNode);//获取⽗亲节点下⾯的所有⼦节点

for(inti=0;irows.Length;i++)

{

//intFindParent=html.ToString().IndexOf(rows[i][parentid].ToString());

//if(FindParent0)

if(rows[i][parentid].ToString()==parentNode)

{

//html.Insert(html.ToString().IndexOf(,FindParent),+rows[i][id].ToString()+rows[i][subjectname].ToString()+rows[i]

[parentid].ToString()+);

html.Append(+rows[i][id].ToString()+rows[i][subjectname].ToString()+rows[i][parentid].ToString()+);

}

CreateChildNode(rows[i][id].ToString(),dt);//递归调⽤添加孩⼦函数

}

}

privatevoidCreateChildNodeDESC(stringparentNode,DataTabledt)//创建孩⼦节点,倒序

{

DataRow[]rows=dt.Select(parentid=+parentNode);//获取⽗亲节点下⾯的所有⼦节点

for(inti=rows.Length-1;i=0;i--)

{

//intFindParent=html.ToString().IndexOf(rows[i][parentid].ToString());

//if(FindParent0)

if(rows[i][parentid].ToString()==parentNode)

{

//html.Insert(html.ToString().IndexOf(,FindParent),+rows[i][id].ToString()+rows[i][subjectname].ToString()+rows[i]

[parentid].ToString()+);

html.Append(+rows[i][id].ToString()+rows[i][subjectname].ToString()+rows[i][parentid].ToString()+);

}

CreateChildNode(rows[i][id].ToString(),dt);//递归调⽤添加孩⼦函数

}

}

publicDataTablegetTable(strings