Binary tree breadth First traversal in C + +

BFS is faster-find shortest path from root to leaf node of a tree. But the tradeoff are to use more memory.

The basic trategy is to maintain a list-to-hold nodes of each level.

1 voidBFS (treenode<t>*node) {2    if(node = =null)//If node is null, return3       return;4   Else{5std::list<treenode<t>* >Current ;6 current.push_back (node);7       while(Current.size! =0){8std::list<treenode<t>* >Next_level;9          for(std::list<treenode<t>* >::iterator ITR =current.beign ();TenITR! = Current.end (); ++ITR) { One            if(node->left) Next_level.push_back (node->Left ); A            if(node->right) Next_level.push_back (node->Right ); -         } -Current =Next_level; the     }   -   }    -}

You could use iterator to traverse the current list to print out the values as well.

Binary tree breadth First traversal in C + +