Here it is a nice solution: http://cslibrary.stanford.edu/109/TreeListRecursion.html
On Sun, Mar 28, 2010 at 11:09 AM, Piyush Verma <114piy...@gmail.com> wrote: > How can we convert a BST into a sorted doubly linked list? > i have the solution that i traverse BST in inorder traversal and > storing elements in doubly linked list. > anyone has any best solution. > > -- > Piyush Kumar Verma > NIT Allahabad > > -- > 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.
