/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
void LevelOrderTraverse(TreeNode* pRoot){
deque<TreeNode*> q;
TreeNode* p = pRoot;
q.push_back(p);
while(!q.empty()){
p = q.pop_front();
std::cout<<p->val;
if(p->left) q.push(p->left);
if(p->right) q.push(p->right);
}
std::cout<<std::endl;
}