degcba? for each level, use a deque to store nodes, if you want to output the tree from left to right, traverse the deque from begin to end; otherwise from end to begin
On 10月7日, 下午4时23分, umesh kewat <umesh1...@gmail.com> wrote: > hi, > add some more constrain on above problem > here desired output is g e d c b a for given tree what will be approach > if desired output level wise like > > degbca > > Traversing the tree from left to right in place of right to left in level > wise bottom to top...... [:)] > > 2009/10/7 hopper <ssq...@gmail.com> > > > > > harit's method is the typical one about width first search, it can > > solve the problem. > > > On 10月7日, 上午3时59分, Manisha <pgo...@gmail.com> wrote: > > > Thanks a Ton everybody! > > -- > Thanks & Regards > > Umesh kewat > Hyderabad > > Sent from Hyderabad, AP, India --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
