Find the middle node in the linked list??
(Note:Do not use for loop, count and count/2)
- 6 Answers
- 11416 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 |
Write a program to add the following ¼+2/4+3/4+5/3+6/3+... (Like up to any 12 no.s)
Why doesn't the code "a[i] = i++;" work?
Derive the complexity expression for AVL tree?
What is scope of variable in c?
what is y value of the code if input x=10 y=5; if (x==10) else if(x==9) elae y=8; a.9 b.8 c.6 d.7
Explain what happens if you free a pointer twice?
What is a symbolic constant?
Hai,I have done with my bachelor of commerce and planing to ms,please suggest me how to convince vo for shifting from commerce to computers. Visa on 8 DEC 2014 Npu university
declare afunction pointer to int printf(char *)?
yogesh patil in dell
define function
Explain what are the __date__ and __time__ preprocessor commands?
C 
