Single linked list inversion

From , 5 Years ago, written in C, viewed 214 times.

void reverse ( Linklist H )
{
        LNode *p;
        p=H->next; /*p指向第一个数据结点*/
        H->next=NULL; /*将原链表置为空表H*/
        while ( p )
        {
                q=p;
                p=p->next;
                q->next=H->next; /*将当前结点插到头结点的后面*/
                H->next=q;
        }
}

Reply to "Single linked list inversion"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Single linked list inversion

Reply to "Single linked list inversion"