We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Tree: Level Order Traversal
  5. Discussions

Tree: Level Order Traversal

  • 24BCS10399
     + 0 comments
    1. if(root==NULL) return; queueq; q.push(root); while(!q.empty()){ Node*current=q.front(); q.pop(); cout<data<<" "; if(current->left!=NULL){ q.push(current->left); } if(current->right!=NULL){ q.push(current->right); } }