ladder depth first

LadderDepthFirst.cs

void Main()
{
    //Store the root node in Container 
    //While (there are nodes in Container) 
    //   N = Get the "next" node from Container 
    //   Store all the children of N in Container 
    //   Do some work on N  
    var paths = new List<int[]>();
    int N = 10;
    var stack = new Stack();
    stack.Push(new int[] { 0 });
    while(stack.Count > 0)
    {
        if(stack.Count > max) max = stack.Count;
        var next = stack.Pop() as int[];
        int total = next.Sum();
        if(total < N + 1)
        {
            stack.Push(next.Concat(new int [] { 1 }).ToArray());
        }
        if(total < N + 2)
        {
            stack.Push(next.Concat(new int [] { 2 }).ToArray());
        }
        if(next.Sum() == N)
        {
            paths.Add(next.ToArray());
        }
    }
}