@WgpShashank: actually linked list is a good choice if tree height is
large.Array may not able to fill it.
--
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
Right idea. But you only need to remove the last item once, right at
the end of the function.
Don
On Jan 30, 1:01 am, atul anand atul.87fri...@gmail.com wrote:
@Mihir : actually you are using linked listso you are keep on adding
the nodes but not removing it..hence...you are getting wrong
@don : right didn't check the flow of code correctly
On Mon, Jan 30, 2012 at 9:53 PM, Don dondod...@gmail.com wrote:
Right idea. But you only need to remove the last item once, right at
the end of the function.
Don
On Jan 30, 1:01 am, atul anand atul.87fri...@gmail.com wrote:
