C++ 实现二叉树的非递归层次遍历(队列实现)

Posted 2021-05-16 Wecccccccc

代码如下:

void BinaryTree::LevelOrder(BinTreeNode *cur) {
	if (cur == NULL)
		return ;
	queue<BinTreeNode *>q;
	q.push(cur);
	while (q.size()) {
		BinTreeNode *t = q.front();
		q.pop();
		if (t == NULL)
			continue;
		cout << t->data << " ";
		q.push(t->lchild);
		q.push(t->rchild);
	}
}