Ashok S Meti

• Apr 29th, 2006

 

using rear and front pointer...........

santosh kumar routhu

• May 23rd, 2006

 

struct node

{  int data;

   struct node *next;

};

i write just function here

int count(struct node *pp)

{  struct node *start;

  int count=0;

   start=pp->next;

  while(start->next!=pp)

  { start=start->next;  

   count++; }

  return count;

}

here count gives no of nodes in that list

Hanumantappa

• May 31st, 2006

 

int count(struct node *q){int i;while(q!=null){i++;q=q->next;}return (i);}

sunil kumar

• Jan 22nd, 2007

 

we cant find the node having next =NULL
then how we can find the number fo node in cir link list
(if any comment plz mail me)

fairy

• Apr 26th, 2007

 

how can u check for NULL...in circular list the next node will never be null

c.s.arthe

• Aug 23rd, 2016

 

If the first node you have started with, comes again in the traversal, we can stop counting. Instead of null we can check next!=first.