#includevoid bfs(Node*root){queue q;Node* p;if(root!=NULL) {q.push(root);}else return;while(!q.empty()){p=q.front();if(p->LT) q.push(p->LT);if(p->RT) q.push(p->RT);cout<data<q.pop();}}
