Find the middle node in the linked list??
(Note:Do not use for loop, count and count/2)
- 6 Answers
- 12175 Views
- Subex, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / kstarmind
Keep two pointers,
1. fast pointer moves two nodes at a time
2. slow pointer moves one node at a time
keep moving both the pointers, once the fast pointer reaches
the end node, your slow pointer would be at middle of the list.
| Is This Answer Correct ? | 47 Yes | 5 No |
Answer / kar..
move the front pointer and rear pointer at equal
intervel,these both pointe will meet at one node is middle...
| Is This Answer Correct ? | 2 Yes | 3 No |
U mean without any looping statements r just for loop?????
It can be done in a single traversal using Hare n turtle
method as said above using a for or while loop.....
Without using looping statements d list can't be traversed..
Plz make the question clear.....
| Is This Answer Correct ? | 3 Yes | 10 No |
What are .h files and what should I put in them?
Why can arithmetic operations not be performed on void pointers?
What is a null string in c?
What is a program flowchart?
how the size of an integer is decided? - is it based on processor or compiler or OS?
19 Answers HCL, JPR, Microsoft, nvidia,
What does int main () mean?
Illustrate it summing the series 2+4+6+......to n terms using (i) while loop (ii) do-while loop
Are global variables static in c?
Explain how can you avoid including a header more than once?
Why preprocessor should come before source code?
What will happen when freeing memory twice
what is use of malloc and calloc?
C 
