Extensions methods for iteratively traversing trees using Stack<T> and Queue<T>

IterativeTreeExt.cs

    public static class IterativeTreeExt
    {
        public static IEnumerable<T> AsDepthFirstEnumerable<T>(this T head, Func<T, IEnumerable<T>> children)
        {
            var nodes = new Stack<T>(new [] { head });

            while(nodes.Count > 0) 
            {
                var currentnode = nodes.Pop();

                foreach (var child in children(currentnode))
                    nodes.Push(child);

                yield return currentnode;
            }
        }

        public static IEnumerable<T> AsBreadthFirstEnumerable<T>(this T head, Func<T, IEnumerable<T>> children)
        {
            var nodes = new Queue<T>(new[] { head });

            while (nodes.Count > 0)
            {
                var currentnode = nodes.Dequeue();

                foreach (var child in children(currentnode))
                    nodes.Enqueue(child);

                yield return currentnode;
            }
        }
    }