Interested to Buy Any Domain ? << Click Here >> for more details...
Find the middle node in the linked list??
(Note:Do not use for loop, count and count/2)
- 6 Answers
- 13260 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 the types of data structures in c?
How can you restore a redirected standard stream?
What is a structure member in c?
What are the commands should be given before weiting C Program i.e, Cd.. like
4 Answers IBM, Infonet, Satyam, Tech Mahindra,
What are static functions?
C program to read the integer and calculate sum and average using single dimensional array
What is hungarian notation? Is it worthwhile?
Explain how do you use a pointer to a function?
What is this infamous null pointer, anyway?
Is c easy to learn?
How do I send escape sequences to control a terminal or other device?
What is meaning of tree
C 
