Answer Posted / 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;
}

List some applications of queue data structure.

920

---

What is the use of hashtable?

879

---

Is it possible to make an array volatile in java?

906

---

Given M x N matrix with sorted elements row wise and column wise, find elements?

971

---

How do you define a set?

892

---

How can you implement a stack?

1064

---

Write a Program for Reverse a linked list.

938

---

Can we add heterogeneous elements into treemap?

951

---

For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

1296

---

What is heap tree in data structure?

916

---

How to get a list of tables, views and columns in firebird database?

889

---

Explain what is binary search?

938

---

What are the drawbacks of array implementation of queue?

1133

---

Are lists mutable?

935

---

What is inserting in data structure?

952

---