在数据库中作修改,然后重新生成树,而不是修改结点,如果修改结点的话,你程序的效率会很底,这上遍历树的代码:
private void CallTree(TreeView treeView)
{
// Print each node recursively.
TreeNodeCollection nodes = treeView.Nodes;
foreach (TreeNode n in nodes)
{
if(n.Nodes.Count !=0)
{
if(AccessNotes(n))
{
break;
}
}
}
if(this.mFound)
{
this.treeView1.SelectedNode.Parent.Expand();
}
else
{
MessageBox.Show("没有数据,请确认");
return;
}
}
private void CallTree(TreeView treeView)
{
// Print each node recursively.
TreeNodeCollection nodes = treeView.Nodes;
foreach (TreeNode n in nodes)
{
if(n.Nodes.Count !=0)
{
if(AccessNotes(n))
{
break;
}
}
}
if(this.mFound)
{
this.treeView1.SelectedNode.Parent.Expand();
}
else
{
MessageBox.Show("没有数据,请确认");
return;
}
}
{
// Print the node.
if(treeNode.Tag.ToString() == mEmp)
{
this.treeView1.SelectedNode = treeNode;
this.mFound = true;
return true;
}
// Print each node recursively.
foreach (TreeNode tn in treeNode.Nodes)
{
if(AccessNotes(tn))
{
break;
}
}
return false;
}