Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
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)

Answers were Sorted based on User's Feedback



Find the middle node in the linked list?? (Note:Do not use for loop, count and count/2)..

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

Find the middle node in the linked list?? (Note:Do not use for loop, count and count/2)..

Answer / om

just use recursion .....it's simple......

Is This Answer Correct ?    4 Yes 3 No

Find the middle node in the linked list?? (Note:Do not use for loop, count and count/2)..

Answer / santhoshr

It wont work exactly if the no of nodes is not given!!! So
better answer is having two pointers from first itslf.
And like this , another question is there,
to find the pth node from last!! That too haas the same logic!!!

Is This Answer Correct ?    2 Yes 1 No

Find the middle node in the linked list?? (Note:Do not use for loop, count and count/2)..

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

Find the middle node in the linked list?? (Note:Do not use for loop, count and count/2)..

Answer / dhr

it also works

Is This Answer Correct ?    1 Yes 3 No

Find the middle node in the linked list?? (Note:Do not use for loop, count and count/2)..

Answer / vadivel

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

Post New Answer

More C Interview Questions

What is c method?

0 Answers  


how we can say java is platform independent, while we require JVM for that particular Operating System?

3 Answers   Honeywell, TCS,


how can we Declare a variable in c without defining it.

1 Answers   TCS,


can a union be self-referenced?

1 Answers  


What are the advantages of external class?

0 Answers  


which of the following go out of the loopo if expn 2 becoming false a.while(expn 1){...if(expn 2)continue;} b.while(!expn 1){if(expn 2)continue;...} c.do{..if(expn 1)continue;..}while(expn 2); d.while(!expn 2){if(expn 1)continue;..}

4 Answers   TCS,


Taking an example,differentiate b/w loader and linker ?

1 Answers  


what is data structure?

5 Answers   CBSE,


please help me.. how to write a code of this output?? "Enter range number:"10 1 is an odd number 2 is an even numbers 3 in an odd numbers 4 " to 10" "printing all odd numbers:" 1,3,5,7,9 "printing all even numbers:" 2,4,6,8,10 "sum of all odd numbers:25 "sum of all even numbers:30 using a C Programming ARRAY pleas pleas help.. its my project ..please :(

1 Answers  


Function calling procedures? and their differences? Why should one go for Call by Reference?

0 Answers   ADP,


What are the modifiers available in c programming language?

0 Answers  


Which of the Following will define a type NODE that is a node in a Linked list? A)struct node {NODE*next;int x;};type def struct node NODE; B)typedef struct NODE {struct NODE *next;int x;}; C)typedef struct NODE {NODE *next;int x;}; D)typedef struct {NODE *next;int x;}NODE;

5 Answers   Accenture, TCS,


Categories