C++模板实现二叉查找树(四 广度优先遍历)

(LinkQueue<BinNode<T>*, capacity> *queueHelper;)

template <class T, unsigned int capacity>
bool BinSearchTree<T, capacity>::scopeOrder()
{
bool result = false;
if (isEmpty())
{
result = false;
}
else
{
queueHelper = new LinkQueue<BinNode<T>*, capacity>();
queueHelper->enQueue(root);
while (!(queueHelper->isEmpty()))
{
BinNode<T>* temp = NULL;
queueHelper->deQueue(temp);
cout << "ScopeOrder: The value is :" << temp->data << endl;
if (NULL != temp->left)
{
queueHelper->enQueue(temp->left);
}
if (NULL != temp->right)
{
queueHelper->enQueue(temp->right);
}
}
if (NULL != queueHelper)
{
delete queueHelper;
queueHelper = NULL;
}
result = true;
}
return result;
}