to do level order traversal u can apply BFS taking root node as a starting node
u can implement it either in a iterative way or recursive way On Sun, Jul 11, 2010 at 6:42 PM, harit agarwal <[email protected]>wrote: > here is the recursion > http://geeksforgeeks.org/?p=2686 > execution: > http://codepad.org/pMszw4Y8 > > was it difficult to google it???? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Devendra Pratap Singh B.Tech (IT) IIIT - Allahabad -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
