public bool QIsEmpty(LQueue pq)
{
if (pq.front == null)
{
return(true);
}
else
{
return(false);
}
}
public void BFS()
{
LQueue que = new LQueue();
BTreeNode tempbt = new BTreeNode();
tempbt = this;
que.Enqueue(tempbt);
while (tempbt != null)
{
if (tempbt.left != null)
{
que.Enqueue(tempbt.left);
}
if (tempbt.right != null)
{
que.Enqueue(tempbt.right);
}
Console.WriteLine("{0}", tempbt.data);
tempbt = que.Dequeue();
}
}