Do you have 'parent pointers' stored at every node? Anurag Sharma
On Wed, Jun 9, 2010 at 2:26 PM, sharad <sharad20073...@gmail.com> wrote: > can any one tell me how to code for vertical level traversal of a > binary tree????? > > > 1 > / \ > 2 3 > / \ / \ > 4 5 6 7 > > > print > > 4 2 1 5 6 3 7 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
