previous solution using two pointer,was it allowed. ?
Ans : How about insert after the given pointer and swap the value of newly
inserted node with the given pointer node.
On Wed, Oct 6, 2010 at 11:20 PM, RAHUL KUJUR <kujurismonu2...@gmail.com>wrote:
> Take two pointers p and q. Initially p points to head.
>
>
> while(p!="given pointer")
> {
> p=p->link;
> q=p;
> };
>
> Now you hv pointer at 3rd and 4th position. Now insertion is simple....Hope
> this will work
>
>
> --
> 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.
