create an singly linked lists and reverse the lists by
interchanging the links and not the data?
- 13 Answers
- 16521 Views
- Microsoft, TCS, I also Faced
- E-Mail Answers
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
State the rules to be followed during infix to postfix conversions?
What are the benefits of using arrays?
You want to insert a new item in a binary search tree. How would you do it?
Tell me what is quick sort?
write an algorithm to show the procedure of insertion into a b-tree?
Write a Program for Linked list manipulation.
What is queue example?
Is hashset a collection?
What is copyonwritearraylist?
Define splay tree?
Can the double-checked locking fail on a single processor system?
What are the different data structures?
Define double hashing?
Which is faster hashmap or concurrenthashmap?
Why does hashset use hashmap?
