create an singly linked lists and reverse the lists by
interchanging the links and not the data?
Answer Posted / vijayan
struct node{
int data;
node * next;
};
node *pt1,*pt2=NULL:
while(root!=NULL)
{
pt1=root;
root=root->next;
pt1->next=pt2;
pt2=pt1;
}
| Is This Answer Correct ? | 31 Yes | 3 No |
Post New Answer View All Answers
What is Another name of Dynamically allocating memory.
What is harvesting in agriculture?
why boundary tag representation is used?
What is the minimization factor and time complexity of b-tree?
Which is faster hashmap or linkedhashmap?
Differentiate between failfast and failsafe.
What is difference between list and array list?
Is list an array?
How can you insert a node in a random location of the linked list?
How do you declare An array of three char pointers
What are different techniques for making hash function? Explain with example.
What are priority queues?
What is the difference between one and two dimensional?
What are the goals of data structure?
Is a hashset ordered?