C++面试题：从上到下打印二叉树

不分行从上到下打印二叉树

思路：层级打印

void PrintFromTopToBottom(BinaryTreeNode* pTreeRoot)

{

if(!pTreeRoot)

return;

std::deque dequeTreeNode;*>

dequeTreeNode.push_back(pTreeRoot);

while(dequeTreeNode.size())

{

BinaryTreeNode *pNode=dequeTreeNode.front();

dequeTreeNode.pop_front();

printf("%d",pNode->m_nValue);

if(pNode->m_pLeft)

dequeTreeNode.push_back(pNode->m_pLeft);

if(pNode->m_pRight)

dequeTreeNode.push_back(pNode->m_pRight);

}

}

想法：越到这本书的后面，代码就越来越“C++化”，很难受，我只能理解过后抄一遍上来。