/*
面试题23:从上往下打印二叉树
从上往下打印出二叉树的每一个节点,同一层的结点按照从左到右的顺序打印。
如图:从上往下依次打印数据为:8 3 10 1 6 14 4 7 13.
/*
解题思路:1.从上往下打印,即按层依次打印,首先打印根结点,接下来打印它的两个子结点。
2.借助容器队列(先入先出),如果该结点有子结点,就将子结点放到队列的末尾,队列的头部取出最早进入队列的结点。
*/
#include<deque>
struct BinaryTreeNode
{
int m_nValue;
BinaryTreeNode* m_pLeft;
BinaryTreeNode* m_pRight;
};
BinaryTreeNode* Create()
{
BinaryTreeNode *pRoot;
int data;
cin>>data;
if(data ==0)
{
pRoot = NULL;
}
else
{
pRoot = new BinaryTreeNode;
pRoot->m_nValue = data;
pRoot->m_pLeft = Create( );
pRoot->m_pRight = Create( );
}
return pRoot;
}
void PrintFromTopToBotton(BinaryTreeNode *pRoot)
{
if(!pRoot)
return ;
deque<BinaryTreeNode*> dequeNode; //队列 先进先出
dequeNode.push_back(pRoot);
while(dequeNode.size ())
{
BinaryTreeNode *pNode = dequeNode.front(); //将双端队列的首元素给pNode
dequeNode.pop_front(); //删除队列第一个元素
cout<<pNode->m_nValue <<" ";
if(pNode->m_pLeft ) //若左结点不空,将其左结点存入到双端队列中
dequeNode.push_back(pNode->m_pLeft );
if(pNode->m_pRight ) //若右结点不空,将其右结点存入到双端队列中
dequeNode.push_back(pNode->m_pRight );
}
}
int main()
{
BinaryTreeNode* pRoot = NULL;
cout<<"The Tree is:"<<endl;
pRoot= Create();
cout<<"从上往下依次打印二叉树:";
PrintFromTopToBotton(pRoot);
}
#endif