Data structure and algorithm-in-place inverse of a linked list

Source: Internet
Author: User

Linked list operation, single-linked list in-place reverse

void Inverse (linklist &l) {Lnode *p, *q;p = l->next;             /* Record first node address */l->next = NULL;      /* Set the list to empty table */while (P! = NULL)//    * Insert each node in turn by the head interpolation to achieve the inverse */{    q = p;                              /* Use Q to record the node address to be inserted */    p = p->next;                    /* Record the subsequent node address of the node to be inserted with P */*/    q->next = l->next;          /* Insert Q (to insert node) in front of the head node */    l->next = q;                    /* Add new Insert node as new header */}}

Data structure and algorithm-in-place inverse of a linked list

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.