Simple breadth first question

[myoung34]

I've got a working Binary Tree class, and a working breadth first traversal (using stl queue), but just need someone to help me implement a level feature.
for example, a tree with root 'a' and two children 'b' and 'c' on my program outputs a b c, where i would like it to output
a
b c

Heres my code for breadthfirst

void Tree::breadthfirst(Tree *t) {

	queue<Tree> q;

	q.push(*t);
	while (!q.empty()) {

		*t=q.front();

		q.pop();

		cout << t->RootData() << " ";

		if (t->Left() != NULL)

			q.push(*t->Left());

		if (t->Right() != NULL)

			q.push(*t->Right());

	}

}

[imi]

please don't double-post. http://www.cplusplus.com/forum/beginner/21121/

Ciao, Imi.