create an singly linked lists and reverse the lists by interchanging the links

create an singly linked lists and reverse the lists by
interchanging the links and not the data?

Question Posted / vignesh1988i

13 Answers
20838 Views
Microsoft, TCS, I also Faced
E-Mail Answers

Answers were Sorted based on User's Feedback

create an singly linked lists and reverse the lists by interchanging the links and not the data?..

Answer / guest

public class ReverseList {

public static void main(String[] args) {
ReverseList revalgo = new ReverseList ();
Node n1 = new Node();
n1.data = "A";
revalgo.insert(n1);

n1 = new Node();
n1.data = "B";
revalgo.insert(n1);

n1 = new Node();
n1.data = "C";
revalgo.insert(n1);

n1 = new Node();
n1.data = "D";
revalgo.insert(n1);

n1 = new Node();
n1.data = "E";
revalgo.insert(n1);
System.out.println("Link List");
revalgo.print();
System.out.println("Reversed Link List");
revalgo.reverse();
revalgo.print();
}

void insert(Node n)
{
n.next = root;
root = n;
}

void print()
{
Node current = root;
while(current != null)
{
System.out.print(current.data + "->");
current = current.next;
if(current == null)
System.out.println(""+ null);
}
}

void reverse()
{
Node current = null;
Node prev = null;
while(root != null)
{
current = root;
root = root.next;
current.next = prev;
prev = current;
}
root = current;
}

Node root = null;
}

class Node {
String data;
Node next;
}

Is This Answer Correct ?

1 Yes

2 No

create an singly linked lists and reverse the lists by interchanging the links and not the data?..

Answer / vaishali naidu

We can achive this using following method:
Use three pointers
First is start pointing to first node.
Second is prev pointing to second node
Third is curr pointing to third node.
a.while(start!=curr)
{
prev->next=start
start->next=NULL;
start=prev;
prev=curr;
curr=curr->next;
}

Is This Answer Correct ?

13 Yes

21 No

create an singly linked lists and reverse the lists by interchanging the links and not the data?..

Answer / sanjay rajput

struct node
{
int val;
struct node *next;
};

typedef struct node NODE;
NODE *p,*start;
p=start->next;
while(p!=NULL)
{
p->next=start;
start=p;
p=p->next;
}