chandan

• Jul 18th, 2006

 

Code
span style="color: #808080; font-style: italic;">/* AFTER CREATING LINK LIST *//* insert value of 1st node  into p */


        h = h->next;


        p->next = H;            /* insert p->next =NULL ,because H is equals to NULL (1st time) */


        H = p;                  /* insert address of p into H */

pranjal5215

 Profile Answers by pranjal5215 

• Aug 3rd, 2008

 

This is a complete program to reverse a linked list in C.
first node is allocated memory but doesn't contain any data.

Code
#include<stdio.h>


#include<stdlib.h>


" %d""n"

pranjal5215

 Profile Answers by pranjal5215 

• Jul 10th, 2009

 

This is the recursive version of the program.

Code
#include<stdio.h>


#include<stdlib.h>


" %d", temp->month);


}


 


node *reverse_recurse(node * cur, node * start)


{                               /*reverse linked list recursively */"n"

cleonjoys

 Profile Answers by cleonjoys 

• Oct 21st, 2010

 

This is dummy program I have written concentrating mainly on reversing the List rather than implementing efficient way in adding to list and displaying it :)

I have written Algo for the reverse also please check it for easier understanding.

Code
#include <stdio.h>


#include <stdlib.h>


/* Design flow


.


1    rev(2) -> store NULL


    2    rev(3) -> store 1


        3    NULL -> store 2


            ..continues after the recursive calls, so here it needs to store the previous


            value


   


call is


    reverse(start, NULL)


 


1->2->3


call reverse(1, NULL)


        nptr = 1


        prevPtr = NULL


        1->next != NULL


            call reverse(2, 1)


            nptr = 2


            prevPtr = 1


            2->next != NULL


                call reverse(3, 2)


                nptr = 3


                prevPtr = 2


                3->next == NULL; so return from here


   


                3->next = 2


            2->next = 1


        1->next = NULL


*/


 


/* Its O(n-1) in space complexity */"System OOOn""%d ""%dn""Starting creation of the List!!n""Contents of the list as follows:-n""After reverse the list has: n"

ss0101782

 Profile Answers by ss0101782 

• Dec 31st, 2010

 

Code
#include"stdio.h"


#include"stdlib.h"


#include"conio.h"


#include"string.h"


#include"alloc.h"


"n ********** Add node at begining of the list **********""n ********** Add node at end of the list **********""n ********** Add node at any position of the list **********""n ********** Deletion of node from the list **********""n ********** Revers the list **********""n Enter the number of nodes::");


    scanf("%d""n the node number::%d""n Enter student roll number::");


        scanf("%d""n Enter student name::""n Enter student total marks::");


        scanf("%d""n student roll number::%4d""n student name ::%s""n student total marks::%4d""n--------------------------------""n Enter student roll number::");


    scanf("%d""n Enter student name::""n Enter student total marks::");


    scanf("%d""n Enter student roll number::");


    scanf("%d""n Enter student name::""n Enter student total marks::");


    scanf("%d""n Enter the position where you want to add the node::");


    scanf("%d""n wrong entry::""n Enter student roll number::");


    scanf("%d""n Enter student name::""n Enter student total marks::");


    scanf("%d""n sorry position not found::""n Enter student's roll number which is to be deleted::");


    scanf("%d", &rl);


    fflush(stdin);


    p1 = tail;


    // p=head1;"n node position not found::"

ankit srivastava

• Oct 17th, 2011

 

public void ReverseLinkedList (LinkedList linkedList)
{
// ------------------------------------------------------------
// Create a new linked list and add all items of given
// linked list to the copy linked list in reverse order
// ------------------------------------------------------------

LinkedList copyList = new LinkedList();

// ------------------------------------------------------------
// Start from the latest node
// ------------------------------------------------------------

LinkedListNode start = linkedList.Tail;

// ------------------------------------------------------------
// Traverse until the first node is found
// ------------------------------------------------------------

while (start != null)
{
// ------------------------------------------------------------
// Add item to the new link list
// ------------------------------------------------------------

copyList.Add (start.Item);

start = start.Previous;
}

linkedList = copyList;

// ------------------------------------------------------------
// That's it!
// ------------------------------------------------------------
}

samCPP

 Profile Answers by samCPP 

• Dec 4th, 2011

 

Reversing a Linked list using temporary pointer

Code
#include<iostream.h>


#include<conio.h>


"   "//Temporary pointer for reversal"    ""Enter choice""enter element "" List is "" Reverse List is "