struct BinaryTreeNode{
int m_value;
BinaryTreeNode *leftTree;
BinaryTreeNode *rightTree;
};
void printBinaryTree_BFS(BinaryTreeNode *root){
queue<BinaryTreeNode*> Q;
Q.push(root);
while(!Q.empty()){
BinaryTreeNode *temp = Q.front();
cout<<temp->m_value<<endl;
if(temp->leftTree!=NULL){
Q.push(temp->leftTree);
}
if(temp->rightTree!=NULL){
Q.push(temp->rightTree);
}
Q.pop();
}
}