数据结构上机实验报告-二叉树(8)

void BT_PostOrderNoRec(pTreeT root) { } void BT_LevelOrder(pTreeT root) { queue<treeT *> q; treeT *treePtr; assert( NULL != root ); q.push(root); while (!q.empty()) { treePtr = q.front(); q.pop(); visit(treePtr); if (NULL != treePtr->left) { q.push(treePtr->left);