一个循环递归遍历问题

public Class A
{
    public string Name{get;set;}
    public list<A> children{get;set;}
}

        public A FindByName(string _name)
        {
            if (this.Name == _name)
                return this;
            else
            {
                for (int i = 0; i < this.children.Count; i++)                
                     return this.children[i].FindByName(_name);
            }
            return null;
        }

        public A FindByName(string _name)
        {
            if (this.Name == _name)
                return this;
            else
            {
                A p = null;
                for (int i = 0; i < this.children.Count; i++)
                {
                    p = this.children[i].FindByName(_name);
                    if (p != null)
                        break;
                }
                return p;
            }
        }