使用C#非递归实现查找树节点

/// <summary>
/// 作者：GENGWEI
/// </summary>

/// <summary>
/// 非递归查找树节点
/// </summary>
/// <param name="t"></param>
/// <param name="s"></param>
/// <returns></returns>
static TNode FindNode(TNode t,string s)
{
if (t == null)
{
return null;
}
else
{
Queue<TNode> st = new Queue<TNode>();
st.Enqueue(t);
TNode p;
while (st.Count > 0)
{
p = st.Dequeue();
if (p.Data == s)
{
return p;
}
else
{
if (p.left != null)
{
st.Enqueue(p.left);
}
if (p.right != null)
{
st.Enqueue(p.right);
}
}
}
}
return null;
}