create an SINGLE LINKED LISTS and reverse the data in the
lists completely
Answers were Sorted based on User's Feedback
Answer / akansha sharma
create linklist, with node having DATA which contain
information and NEXT which cointain address of next node.
The pointer START pointing to first node of linklist. PREV
pointer point to first node(where START point) and TEMP
pointer which point at last node(by traversing).
Swap data of TEMP and PREV. Now increment TEMP(TEMP=TEMP-
>NEXT) and decreament TEMP.
Repeat this untill TEMP=PREV
| Is This Answer Correct ? | 1 Yes | 1 No |
Answer / vignesh1988i
dear sir ,
your logic might be incorrect , AND GIVE THE FULL PROGRAM SIR
sir you have told that TEMP pointer which point to the last
node.... ok ,for first you can swap the data.... ie STARTING
to TEMP. but how will you arrive at next pair of node for
swapping by decrementing the TEMP , ... a single linked
lists can travel only in one direction from HEAD till NULL
......
THANK U
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / praveen
Push all the elements into a stack (one by one) and then
create a new list by popping of the elements from the stack
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the process to create increment and decrement stamen in c?
What does c value mean?
What are static variables in c?
How old is c programming language?
What is a pointer value and address in c?
What is logical error?
What is output of the following program ? main() { i = 1; printf("%d %d %d\n",i,i++,i++); }
What is the use of gets and puts?
What is break in c?
how to connect oracle in C/C++.
What is the exact difference between '\0' and ""
What is indirect recursion? give an example?