create an singly linked lists and reverse the lists by
interchanging the links and not the data?
Answer Posted / jishu
This is a more efficient version of the program given in ans 2.
p=head;
result=NULL;
while(p!=NULL)
{
temp=p->next;
p->next=result;
result=p;
p=temp;
}
| Is This Answer Correct ? | 2 Yes | 1 No |
Post New Answer View All Answers
Does arraylist guarantee insertion order?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
Is arraylist a class?
Define b-tree of order m?
What are different types of sorting techniques?
What is array and its types with example?
Can you provide some implementation of a dictionary having large number of words?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
Why entry interface is used in map?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
Differentiate between collection and collections.
Is pointer a variable in data structure?
Why we use linked list?
Run time memory allocation is known as ?
How to excel in data structures and algorithms?