bfs.cpp

#include <iostream>
#include <cstddef>
#include <queue>
#include <string>
#include <cstdlib>

using namespace std;	
class Node{
    public:
        int data;
        Node *left,*right;
        Node(int d){
            data=d;
            left=right=NULL;
        }
};
class Solution{
    public:
  		Node* insert(Node* root, int data){
            if(root==NULL){
                return new Node(data);
            }
            else{
                Node* cur;
                if(data<=root->data){
                    cur=insert(root->left,data);
                    root->left=cur;
                }
                else{
                   cur=insert(root->right,data);
                   root->right=cur;
                 }           
           return root;
           }
        }

        queue <Node*> v;
void levelOrder(Node * root)
{
      //Write your code here
       if(root != NULL)
        {
            v.push(root);
            while(!v.empty()) 
            {
            // dequeue next node
            Node* tree = v.front();
                cout <<tree->data<<" ";
            // enqueue child elements from next level in order
            if(tree->left != NULL) {
                v.push(tree->left);
                
            }
            if(tree->right != NULL) {
                v.push(tree->right);
            }
                v.pop();
            }
        }
        
}  
};//End of Solution
int main(){
    Solution myTree;
    Node* root=NULL;
    int T,data;
    cin>>T;
    while(T-->0){
        cin>>data;
        root= myTree.insert(root,data);
    }
    myTree.levelOrder(root);
    return 0;
}