//递归算法,代码如下: private TreeNode FindNode( TreeNode tnParent, string strValue ) { if( tnParent == null ) return null; if( tnParent.Text == strValue ) return tnParent; TreeNode tnRet = null; foreach( TreeNode tn in tnParent.Nodes ) { tnRet = FindNode( tn, strValue ); if( tnRet != null ) break; } return tnRet; }