yes....bfs will do !! --
Amol Sharma Third Year Student Computer Science and Engineering MNNIT Allahabad <http://gplus.to/amolsharma99> <http://twitter.com/amolsharma99><http://in.linkedin.com/pub/amol-sharma/21/79b/507><http://youtube.com/amolsharma99> On Sun, Aug 21, 2011 at 9:37 AM, Naman Mahor <naman.ma...@gmail.com> wrote: > ght modification. so in bfs we use queue we have to add a dummy node in > queue. So this node will tell us that end of level has come.so we can find > out the no of node at any lev -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
