public Count_Number_of_Unival_Subtrees()
{
testcases.Add(new InOut <int>(Helfer.AssembleBTree("0102210222211", new BinaryCompleteTree <int>(), true), 5));
testcases.Add(new InOut <char>(Helfer.AssembleBTreeChar("aaa//aa///////A", new BinaryCompleteTree <char>()), 3));
testcases.Add(new InOut <char>(Helfer.AssembleBTreeChar("acb//bb///////b", new BinaryCompleteTree <char>()), 5));
}
public InOut(string s, string s2) : base(Helfer.AssembleBTree(s, new BinaryCompleteTree <int>(), true, -1), s2, true)
{
AddSolver((arg, erg) => erg.Setze(arg.PrintIterative(TraverseType.LevelOrder, arg.GetLargestBst((i, i2) => i.CompareTo(i2)), "")), "Rekursiv");
}
public Input(String s, int k)
{
this.s = s;
this.k = k;
tree = Helfer.AssembleBTree(s) as BinarySearchTree <int>;
}