题目:
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
知识点:
- 像这种不是按照指针顺序打印的都需要引入辅助空间,由于分析可知,先进先出,因此我们引入了两端都可进出的队列deque,常用操作,deque.front(),back(),push_back(),pop_back()等
注意:
无
代码实现:
借助辅助队列,弹出队列头节点的同时,在队列后压入头节点的左右子节点,循环至队列中无元素 。
/*从上到下打印二叉树*/
vector<int> PrintFromTopToBottom(BinaryTreeNode* root) {
//创建辅助队列
deque<BinaryTreeNode* > fzDeque;
vector<int> res;
//特殊情况
if (root == nullptr)
return res;
fzDeque.push_back(root);
//循环至辅助队列为空
while (fzDeque.size())
{
BinaryTreeNode* pHead = fzDeque.front();
//将头结点的值放入res中
res.push_back(pHead->m_nValue);
//将头结点的左右子树放入fzDeque
if (pHead->m_pLeft)
{
fzDeque.push_back(pHead->m_pLeft);
}
if(pHead->m_pRight)
fzDeque.push_back(pHead->m_pRight);
//弹出头结点
fzDeque.pop_front();
}
return res;
}
int main()
{
/*从上到下打印二叉树*/
BinaryTreeNode* pNode10 = CreateBinaryTreeNode(10);
BinaryTreeNode* pNode6 = CreateBinaryTreeNode(6);
BinaryTreeNode* pNode14 = CreateBinaryTreeNode(14);
BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);
BinaryTreeNode* pNode8 = CreateBinaryTreeNode(8);
BinaryTreeNode* pNode12 = CreateBinaryTreeNode(12);
BinaryTreeNode* pNode16 = CreateBinaryTreeNode(16);
ConnectTreeNodes(pNode10, pNode6, pNode14);
ConnectTreeNodes(pNode6, pNode4, pNode8);
ConnectTreeNodes(pNode14, pNode12, pNode16);
vector<int> res = PrintFromTopToBottom(pNode10);
for (int n = 0; n < res.size(); n++)
cout << res[n] << " ";
getchar();
return 0;
}