Linked list Insert

Open More ...     Pcurrent=phead; SS *c;
for (int i= 0;i< i++)
{
if (pcurrent-> a = = 3)
{
ptmp= New SS;
C=pcurrent-> Next;
Pcurrent-> next =ptmp;
pcurrent=ptmp;
Pcurrent-> next =c;
Pcurrent-> a = 20;

}
Pcurrent=pcurrent-> Next;
} Pcurrent=phead; The middle Insert list (x) a ————————— >b ————————— >⬇ ——————————— >c How to insert X. Very simple, create X, the front point X,x point to the back. Use another pointer to record the following, good point. ptmp= New Ss1; ptmp->x=18; Ptmp-> next =phead; phead=ptmp; Before inserting the list (x) ⬇ ————————— >a ————————— >b ——————————— >c How to insert X. Very simple, the creation of X,x point to the previous head, the head into X. while (pcurrent-> next)
{
P=pcurrent;
Pcurrent=pcurrent-> Next; } ptmp= new Ss1; ptmp->x=22; Pcurrent-> next =ptmp; pcurrent=ptmp;                                                                                                                                           Insert List after (x) a ————————— >b ——————————— >c ————————— >⬇ How to insert X. It's simple, create X, loop to the end of the chain, point to X.

Insert on the right here;