Answer Posted / salil

This is the same solution as many have given but I have
tried to make it little easier to understand. The reversal
process can be imagined as creating a new list of nodes
coming out of the old list. Assuming that the two lists are
known by their heads oldhead (pointing to the old list) and
new head (pointing to the new list). Basically the steps
involved are:
- move the current node from the old list to the new list
- the new node coming from the old list comes to the head
of the new list
- make the new node point to the head of the new list you
had so far - also means the new node becomes the new head
for the new list
- adjust the heads of the new and old list
- do these steps until the oldhead points to null. of
course, you will need to start with the newhead being null.

reverse(struct node *head)
{
struct node *oldhead,*newhead,*t;
oldhead=head;
newhead= NULL;
while(oldhead!=NULL)
{
t=newhead; (save current newhead)
newhead=oldhead; (newhead now points to current
node from old list)
oldhead=oldhead->next; (move oldhead forward)
newhead->next=t; (make new node point to head
of the new list so far)
}
head=newhead;

}

State the advantages of using postfix notations?

1064

---

Write is a binary search tree? Write an algorithm and tell complexity?

910

---

What is linked list ?

949

---

Why sorting is used?

940

---

What are the types of binary tree?

909

---

What are the advantages of data structure?

965

---

What is lifo?

1427

---

Describe avl tree or height balanced binary search tree.

903

---

What is binary search tree and explain its time complexity?

972

---

What is ds tree?

909

---

What is a Stack? Explain with example?

972

---

Program to remove duplicate elements in an array.

1028

---

Define the term “percolate up”?

957

---

Write the algorithm for converting infix expression to postfix expression?

972

---

How to use appendNode() in linkedlist()?

1096

---