@tech. OK.
The person asked to insert the node at 3rd position and given a pointer to 4th position. If you go by the objective of question, e.g 3-->4--->5---->7. I am starting as index 0(which is key value 3 in this case) I have given a pointer to node having key value 7.I have to insert 6(new node). i will do the following. Insert after given node pointer. 3---->4---->5----->7----->6. after swapping it would become. 3----->4----->5------>6------>7. So for client who is using my class function for inserting a node in front of node(which is not possible in our example),doesn't care how i inserted his node in my list,but once he iterate his list , he will find his node first instead of node for which pointer is given in question. I know we can't do that, but if you go by the objective of question,why would some one insert a node in front of some other node,he might want to access it first,so i did the same thing here. He can access his node as he has inserted his node at 3rd place,but actually his node is at 4th place. I hope it will clear your doubt. Rahul. On Thu, Oct 7, 2010 at 4:10 PM, tech rascal <[email protected]> wrote: > @Rahul: u r rite dat swapping can b done wid only 1 pointer and a > variable. But evn doin insertion n swapping won't solve d problem bcoz new > element is to b inserted at 3rd position bt acc 2 ur method ....new element > wud come at 4th position. so, I think its not possible 2 do this in a single > linked list since v don't evn knw whr d head is ....n can't use more > pointers. > > On Thu, Oct 7, 2010 at 1:53 PM, rahul <[email protected]> wrote: > >> @Akarsh. >> >> for inserting only,we need a new node and it is not possible without >> having new pointer(we have to ref. the new node with some pointer.) once >> insertion complete, we left with one pointer which point to old node. >> swapping can be done with 1 pointer only,if nodes are adjacent(in this >> case). >> >> Rahul. >> >> >> On Thu, Oct 7, 2010 at 1:05 PM, Akarsh D <[email protected]> wrote: >> >>> @Rahul : I think the swapping method will work. But still have to use two >>> pointers. >>> >>> On Thu, Oct 7, 2010 at 12:34 AM, sajj <[email protected]> wrote: >>> >>>> In a single linked list its is not at all possible i hope correct me >>>> if im wrong ... with given one pointer and with out knowing where head >>>> is.. even if u know the position of the head it ll help you out for >>>> arriving the solution if and only if it is pointing to any of the >>>> following nodes 1 or 2 or 3 >>>> >>>> On Oct 6, 10:56 pm, shoban babu <[email protected]> wrote: >>>> > @Rahul >>>> > the only one pointer is there and it is pointing to the 4th node >>>> only,, and >>>> > we don't know where the head is points to... >>>> > >>>> > On Wed, Oct 6, 2010 at 11:20 PM, RAHUL KUJUR < >>>> [email protected]>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 [email protected]. >>>> > > To unsubscribe from this group, send email to >>>> > > [email protected]<algogeeks%[email protected]> >>>> <algogeeks%[email protected]<algogeeks%[email protected]> >>>> > >>>> > > . >>>> > > For more options, visit this group at >>>> > >http://groups.google.com/group/algogeeks?hl=en. >>>> > >>>> > -- >>>> > Shoban babu.B >>>> > M.E.,CSA, >>>> > IISc. >>>> >>>> -- >>>> 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. >>> >> >> -- >> 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. > -- 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.
