0

我写了这个函数,但我不知道如何写它的其余部分它应该是递归的,我不知道

  public TreeNode FindNodeByText(TreeView m, string s)
        {
            TreeNodeCollection nodes = m.Nodes;
            foreach (TreeNode n in nodes)
            {
                if (n.Text == s)
                    return n;
                else
                    ??????????
            }
        }
4

1 回答 1

1

像这样的东西:

public TreeNode FindNodeByText(TreeView m, string s)
{
    TreeNodeCollection nodes = m.Nodes;
    foreach (TreeNode n in nodes)
    {
        if (n.Text == s)
            return n;
        else
            return FindNodeByTextInTreeNode(n, s);
    }

    return null;
}

public TreeNode FindNodeByTextInTreeNode(TreeNode node, string s)
{
    TreeNodeCollection nodes = node.ChildNodes;
    foreach (TreeNode n in nodes)
    {
        if (n.Text == s)
            return n;
        else
            return FindNodeByTextInTreeNode(n, s);
    }

    return null;
}
于 2012-08-19T09:24:38.437 回答