C++ 从上到下，从左至右打印二叉树

代码如下：

#include <iostream>
#include "BinaryTree.h"
#include <deque>
using namespace std;
void PrintTree_from_head_to_tail(TreeNode* proot)
{
	if(proot == NULL)
		return;
	deque <TreeNode*> tree_que;
	TreeNode* node = proot;
	tree_que.push_back(node);
	while(!tree_que.empty())
	{
		node = tree_que.front();
		if(node ->pLeft != NULL)
			tree_que.push_back(node ->pLeft);
		if(node ->pRight != NULL)
			tree_que.push_back(node ->pRight);
		cout << node->m_value <<'\t';
		tree_que.pop_front();
	}
}
// ====================测试代码====================
void Test(char* testName, TreeNode* pRoot)
{
    if(testName != NULL)
        printf("%s begins: \n", testName);

    printf("The nodes fr