creating a bst would require extra space. You can do this with an array of char dude.
On Sun, Sep 19, 2010 at 3:31 PM, LG JAYARAM . <[email protected]> wrote: > hi buddy ...Im clear with the idea....hereby I share the concept... > > wat exactly need to be done to solve this task is....better create a Binary > search tree...the Binary search tree will not allow duplicates and If u > perform a inorder traversal....u can get the result...the task is > over....simple and thts it. > > On Sat, Sep 18, 2010 at 11:12 PM, jagadish <[email protected]> wrote: > >> You are given a string which is sorted.. Write a recursive function to >> remove the duplicate characters in the string. >> eg: potatoeos >> output: potaes >> NO extraspace like hash/ bitmaps.. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]<algogeeks%[email protected]> >> . >> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
