Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com
On Fri, Nov 9, 2012 at 10:00 AM, atul anand <[email protected]> wrote: > @saurabh : correct..yes if you are considering recursive approach , so it > will take O(n) space stack.But same can be done using Morris traversal then > space will be constant. > -- 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.
