从上往下打印二叉树

1 struct BinaryTreeNode //节点
2 {
3     int m_nValue;
4     BinaryTreeNode* m_pLeft;
5     BinaryTreeNode* m_pRight;
6 };

 1 //////////////从上往下打印二叉树/////////////////////////
 2 void PrintFromTopToBottom(BinaryTreeNode* pTreeRoot)
 3 {
 4     if (pTreeRoot == NULL)
 5     {
 6         return;
 7     }
 8     list<BinaryTreeNode*> NodeData;
 9     NodeData.push_back(pTreeRoot);
10     BinaryTreeNode* pTemp = 0 ;
11     while (!NodeData.empty())
12     {
13         pTemp = NodeData.front();
14         NodeData.pop_front();
15         cout<<pTemp->m_nValue<<endl;
16         if (pTemp->m_pLeft)
17         {
18             NodeData.push_back(pTemp->m_pLeft);
19         }
20         if (pTemp->m_pRight)
21         {
22             NodeData.push_back(pTemp->m_pRight);
23         }    
24     }
25     
26 }