C# 1,3,5,7 Permutationen (3 Bits), nicht rekursiv

//Tiefe zuerst
Programm
{
Static invalid main (string[] args)
{ INT [] number = INT new [] {1, 3 , 5, 7};
Listendaten = neue Liste();
Baumwurzel = neuer Baum();
Baumeltern = Wurzel;                                                                        🎜>                parent.printf( ); Durchbruch; 🎜> System.Console.Read();

}
Public static void printf(list data)
String D = " (p value = D 1 und D = D + P);
System.Console.WriteLine(D);
}
}
Class Tree
{
Public Tree Parent;
Öffentliche Interpretation NODEDATA;
Öffentliche Liste der Söhne = new List();
Öffentliche Interpretation GetDeep()
{
INT I = 0;
         VAR P = dieser Punkt;                                               🎜>                                                                                                                                    printf()
        { If (P == NULL)
System.Console.WriteLine(PF) von
                                                                                                                                                                            seit >              PF = p.NodeData +                                     🎜>                                                                                     >Kursprogramme
{
static void main(String[] args)
{
INT [] number = INT new[] {1, 3};
Liste ; data = new List ();
                                                                                                                                                                                                               nicht weniger queue();

Baumwurzel = neuer Baum();                                     > parent.printf();
foreach (in tempSon VAR item)
​​​                             // openStack.Push (node);
                                                                       Variant ItemData = openQueue.Dequeue(); / /openStack.Pop(); parent = }

        public static void printf (Liste der Daten)                                                                                                                          System.Console.WriteLine(D);
}

}
Klassenbaum
{
Public Tree Parent;                            Public list ;tree>son = new List ();
Public int GetDeep()
{
INT I = 0;
VAR P = this;
Und (Wahr)
{
                                                                                                                                                                                                        🎜>                                                                          Public void printf()
{
String PF = "";
VAR P = this One point; System.Console.WriteLine(PF); PF = p.NodeData + PF; }