A LinkedList is by itself is a BST such that one child node of each node is null. Do we need a simple BST or height balanced BST?
On Tue, Jul 31, 2012 at 2:39 PM, Ashish Goel <ashg...@gmail.com> wrote: > how would you do "convert sorted doubly linked list to bst using same > nodes as in DLL" > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > > > On Sun, Jul 29, 2012 at 10:30 PM, Purani Sekar <nagapur...@gmail.com>wrote: > >> convert sorted doubly linked list to bst using same nodes as in DLL > > > -- > 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. > -- Umer -- 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.
