public IEnumerable <BinaryTree <T> > Traverse(BinaryTraverseOrder order)
{
switch (order)
{
case BinaryTraverseOrder.PreOrder:
{ return(PreOrderTraverse()); }
case BinaryTraverseOrder.InOrder:
{
return(InOrderTraverse());
}
case BinaryTraverseOrder.OutOrder:
{
return(OutOrderTraverse());
}
case BinaryTraverseOrder.PostOrder:
{
return(PostOrderTraverse());
}
default:
{ return(Traverse(BinaryTraverseOrder.PreOrder)); }
}
}
public BinaryTree(T[] nodes, BinaryTraverseOrder order)
{
}
