HackerRank - Tree - Level Order Traversal

TreeLevelOrderTraversal.cpp

/*
struct node
{
    int data;
    node* left;
    node* right;
}*/
#include <queue>
using namespace std;
void LevelOrder(node * root)
{
   if(root==NULL)
       return; 
   
   queue<node*> myQueue ;
   myQueue.push(root); 
   
   while(!myQueue.empty())
   {
       node* cur = myQueue.front(); 
       myQueue.pop(); 
       printf("%d ", cur->data); 
       if(cur->left!=NULL)
           myQueue.push(cur->left); 
       if(cur->right!=NULL)
           myQueue.push(cur->right); 
   }
  
}