二叉树bfs

tree.java

void PrintNodeByLevel(Node *root)
{
	int parentSize = 1, childSize = 0;
	Node * temp;
	queue<Node *> q;
	q.push(root);
	do
	{
		temp = q.front();		
		cout << temp->data << "  ";
		q.pop();
 
		if (temp->pLeft != NULL) 
		{
			q.push(temp->pLeft);
			childSize ++;
		}
		if (temp->pRight != NULL) 
		{
			q.push(temp->pRight);
			childSize ++;
		}
 
		parentSize--;
		if (parentSize == 0) 
		{
			parentSize = childSize;
			childSize = 0;
			cout << endl;
		}
 
	} while (!q.empty());

}