二叉树层向非递归问题。

void ttree::leverorder()
{
deque > Q;
if(bt=NULL)
return;
Q.push_back(*bt);
node*p;
while(!Q.empty())
{
p=&Q.front();
Q.pop_front();
cout<date;
if(p->lc!=NULL)
Q.push_back(*p->lc);
if(p->rc!=NULL)
Q.push_back(*p->rc);
}
}

void ttree::leverorder()
{
deque > Q;
if(bt=NULL)
return;
Q.push_back(*roo);
node*p;
while(!Q.empty())
{
p=Q.front();
Q.pop_front();
cout<date;
if(p->lc!=NULL)
Q.push_back(*p->lc);
if(p->rc!=NULL)
Q.push_back(*p->rc);
}
}
root穿不进去

http://blog.csdn.net/sysu_arui/article/details/7865873