微软等数据结构+算法面试100题（4）--怎样从顶部开始逐层打印二叉树结点数据？请编程

怎样从顶部开始逐层打印二叉树结点数据？请编程

void LevelOrderTraverse(TreeNode* root)
{
	if(root==NULL)
		return;
	queue<TreeNode*> qu;
	qu.push(root);
	while(!qu.empty())
	{
		root=qu.front();
		if(root->left!=NULL)
			qu.push(root->left);
		if(root->right!=NULL)
			qu.push(root->right);
		cout<<root->data<<" ";
		qu.pop();
	}
	cout<<endl;
}

void LevelOrderTraverse1(TreeNode* root)
{
	if(root==NULL)
		return;
	queue<TreeNode*> qu;
	qu.push(root);
	TreeNode *last=root;
	while(!qu.empty())
	{
		root=qu.front();
		if(root->left!=NULL)
			qu.push(root->left);
		if(root->right!=NULL)
			qu.push(root->right);
		cout<<root->data<<" ";
		if(last==root)
		{
			if(!qu.empty())
				last=qu.back();
			cout<<endl;
		}
		qu.pop();
	}
	cout<<endl;
}

void LevelOrderTraverseTest()
{
	TreeNode* root=NULL;
	cout<<"make tree"<<endl;
	MakeTree(root);
	cout<<"the tree : ";
	LevelOrderTraverse(root);
	cout<<"the tree : ";
	LevelOrderTraverse1(root);
}