In bfs using queue

#1

how can I code using the approach of queue<pair<node*,int>>
please share the code

#2

this was use when we have to print each in the next line

#3

hello @shashankmaheshwari054

u are asking code for level order travesal which print each level in seprate line right?

#4

yes but using queue of pair

#5

what information u will store in that pair?

isnt it queue<Node *> will work fine?

#6

queue<pair<node*,int>> first is for the node and the second one is for the level

#7

ok ok got it.
pls wait . i need to code it first .will share with u soon

#8

check this->

void print(node *root){

      int previouslevel=-1;
      queue< pair<node*,int>  > q;
      q.push({root,0});
      while(!q.empty()){
          pair<node*,int> cur=q.front();
          q.pop();
          int currentNode=cur.first;
          int currentlevel=cur.second;
          if(previouslevel!=currentlevel){ //indicates new level started
               previouslevel=currentlevel;
              cout<<"\n";
          }
          cout<<currentNode->data<<" ";
          if(currentNode->left)
            q.push({currentNode->left,currentlevel+1});
          if(currentNode->right)
            q.push({currentlevel->right,currentlevel+1});  

      }

     
    }
#9

can u share the link

#10
#11

because in this code the symbol are not correctly visible

#12

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.