/C/How to determine the level of each node in the given tree?

How to determine the level of each node in the given tree?

          node                            level [node]   

              s (source node)               0  
              1                            1  
              2                            1  
              3                            2  
              4                            2  
              5                            2  
              6                            2  
              7                            3

Source: hackerearth.com

How to determine the level of each node in the given tree?

   vector <int> v[10] ;   //Vector for maintaining adjacency list explained above
    int level[10]; //To determine the level of each node
    bool vis[10]; //Mark the node if visited 
    void bfs(int s) {
        queue <int> q;
        q.push(s);
        level[ s ] = 0 ;  //Setting the level of the source node as 0
        vis[ s ] = true;
        while(!q.empty())
        {
            int p = q.front();
            q.pop();
            for(int i = 0;i < v[ p ].size() ; i++)
            {
                if(vis[ v[ p ][ i ] ] == false)
                {
            //Setting the level of each node with an increment in the level of parent node
                    level[ v[ p ][ i ] ] = level[ p ]+1;                 
                     q.push(v[ p ][ i ]);
                     vis[ v[ p ][ i ] ] = true;
      }
            }
        }
    }

Source: hackerearth.com

Similar codes

0 vote329 views1 answer
Create syscall
C
0 vote307 views1 answer
Gcd and lcd in c
C
0 vote316 views1 answer
Debian9 remove pack
C
0 vote310 views1 answer
Redis as a service
C
0 vote310 views1 answer
Maatwebsite/excel file import
C
0 vote358 views1 answer
Iterating through a linked list
C
4 votes308 views1 answer
Prime check in c
C
0 vote333 views1 answer
Laravel installation on Linux
C
0 vote354 views3 answers
Install postgres on linux
C
0 vote301 views1 answer
Full installation of clang in ubuntu
C