public InOut(string s, bool b) : base(Helfer.AssembleBTree(s, new BinaryCompleteTree <int>()), b, true)
 {
     //inputStringConverter = arg => arg.PrintIterative(TraverseType.LevelOrder);
     AddSolver((arg, erg) => erg.Setze(arg.IsMirrorIt()), "Iterative");
     AddSolver((arg, erg) => erg.Setze(arg.IsMirrorRecurse()), "Recursive");
 }
Beispiel #2
0
 public Input(string s, TraverseType traverseType)
 {
     tree = Helfer.AssembleBTree(s);
     this.traverseType = traverseType;
 }