public void Traverse(BinaryTreeElement element)
{
if (element.HasNext())
{
Traverse(element.Left);
Traverse(element.Right);
}
else
{
this.MatchCollection.Add(element);
return;
}
}
public void Separate(BinaryTreeElement element)
{
if (element.HasNext())
{
Separate(element.Left);
Separate(element.Right);
}
else
{
this.MatchCollection.Add(element);
return;
}
}
