public List <int> Breadth()
{
if (Root == null)
{
throw new TreeEmptyException();
}
List <int> result = new List <int>();
myQueue <Node> treeQueue = new myQueue <Node>();
Node current = Root;
treeQueue.enQueue(current);
Breadth(treeQueue, result, current);
return(result);
}
public void Breadth(myQueue <Node> treeQueue, List <int> result, Node current)
{
while (treeQueue.Front != null)
{
Node front = treeQueue.deQueue();
result.Add(front.Value);
if (front.Left != null)
{
treeQueue.enQueue(front.Left);
}
if (front.Right != null)
{
treeQueue.enQueue(front.Right);
}
}
}
