转载并参考July的博客http://topic.csdn.net/u/20101126/10/b4f12a00-6280-492f-b785-cb6835a63dc9.html,万分感谢!
题目:
输入一颗二元树,从上往下按层打印树的每个结点,同一层中按照从左往右的顺序打印。
输入:
8
/ \
6 10
/ \ / \
5 7 9 11
输出:8 6 10 5 7 9 11。
/*Title: 16.从上到下从左到右打印二元树
Author: gocode
Date: 2012-10-17*/
#include <iostream>
#include <deque>
using namespace std;
typedef struct Node
{
int m_pData;
Node* m_pLeft;
Node* m_pRight;
} BSTNode;
void AddBSTNode(BSTNode* &pNode, int key)
{
if(NULL == pNode)
{
BSTNode* pNewNode = new BSTNode();
pNewNode->m_pLeft = NULL;
pNewNode->m_pRight = NULL;
pNewNode->m_pData = key;
pNode = pNewNode;
}
else if(key < pNode->m_pData)
AddBSTNode(pNode->m_pLeft, key);
else if(key > pNode->m_pData)
AddBSTNode(pNode->m_pRight, key);
else
cout<<"Duplicate node is not allowed."<<endl;
}
void DisplayBSTFromTopBottomLeftRight(BSTNode* root, deque<BSTNode*>&dequeue)
{
if(NULL == root)
return;
else
dequeue.push_back(root); // 压入队列尾部
while(!dequeue.empty())
{
BSTNode* pCur = dequeue.front(); // 从队列前头取值
BSTNode* pRight = pCur->m_pRight;
BSTNode* pLeft = pCur->m_pLeft;
dequeue.pop_front();
cout<<pCur->m_pData<<" ";
if(NULL != pLeft)
dequeue.push_back(pLeft); // 压入队列尾部
if(NULL != pRight)
dequeue.push_back(pRight); // 压入队列尾部
}
}
void main()
{
deque<BSTNode*> dqe;
BSTNode* myRoot = NULL;
AddBSTNode(myRoot, 8);
AddBSTNode(myRoot, 6);
AddBSTNode(myRoot, 5);
AddBSTNode(myRoot, 10);
AddBSTNode(myRoot, 7);
AddBSTNode(myRoot, 11);
AddBSTNode(myRoot, 9);
DisplayBSTFromTopBottomLeftRight(myRoot, dqe);
system("pause");
}