create an singly linked lists and reverse the lists by
interchanging the links and not the data?
Answers were Sorted based on User's Feedback
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 |
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 |
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;
}
Is This Answer Correct ? | 1 Yes | 10 No |
What stack means?
How do you sort a list in reverse order?
Name few concurrent collection classes?
What are the benefits of using arrays?
Which sorting algorithm is worst?
What is the time complexity of arraylist and linked list?
What is tree in computer science?
Are data structures important?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
Which sort show the best average behavior?
How many passes does bubble sort need?
Can we create a null as a key for a map collection?