If nothing is allowed , as in extra space etcetera We can use morris traversal to find the inorder of the tree .
On Jun 19, 3:25 am, kumar vr <kumarg...@gmail.com> wrote: > Balance the tree and return the Root. > > On Sun, Jun 19, 2011 at 12:10 AM, hary rathor <harry.rat...@gmail.com>wrote: > > > then you can use iterative method instead of recursion ... > > > -- > > 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. -- 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.
