create an singly linked lists and reverse the lists by
interchanging the links and not the data?
Answer Posted / 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 |
Post New Answer View All Answers
How do you declare An array of three pointers to chars
Name few concurrent collection classes?
What type of memory allocation is referred for Linked lists?
Is data structures and algorithms important?
Which language is best for data structures?
What is a undirected graph?
What is the difference between b tree and binary search tree?
What is data structure and its operations?
What are the average and worst time complexity in a sorted binary tree is
Does treemap allow null values?
Explain in brief a linked list.
How can we reverse a singly linked list?
Can we insert null in hashset?
Why is data structure?
What is an externalizable interface?