If BST is stored in an array, which is already in level order, then there is nothing much remaining to do.
On Wed, Nov 24, 2010 at 9:05 PM, vamsee marpu <marpu.vam...@gmail.com>wrote: > Hi, > > > Can anybody help me in solving the following problem: > > > Convert a binary search tree in to a doubly linked list in level order > without using extra space : > > > BST > 1 > / \ > 2 3 > / \ / \ > 4 5 6 7 > > in to double linked list as: 1==2==3==4==5==6==7 > > > I can do it using level order traversal using a queue, but the problem says > no extra space should be used, I tried a lot but can't able to figure out. > > > > Thanks, > M. Vamsee > > > -- > 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.
