Binary_tree_Level_order_traversal.cpp

#include<iostream>
#include<queue>

using namespace std;

struct Node{
    int data;
    struct Node *left;
    struct Node *right;

    Node(int val)                   
    {
        data = val;
        left = NULL;
        right = NULL;
    }
};

void printlevelorder(Node* root)
{
    if(root == NULL)
       return;
    queue<Node*> q;
    q.push(root);
    while(!q.empty())
    {
        Node* node = q.front();
        q.pop();
       if(node!=NULL)
       {
          cout<<node->data<<" ";
          if(node->left)
             q.push(node->left);
          if(node->right)
             q.push(node->right);   
       }
       else if(!q.empty())
       {
           q.push(NULL);
       }
    }   
}

int main()
{
     Node* root = new Node(1);
     root->left = new Node(2);
     root->right = new Node(3);
     root->left->left = new Node(4);
     root->left->right = new Node(5);
     root->right->left = new Node(6);
     root->right->right = new Node(7);
     cout<<"THE LEVEL ORDER TRAVERSAL OF THIS BINARY TREE IS : ";
    printlevelorder(root); 
}