how do i find the number of items in a circular queue?
|front - rear| doesnt always work.
is there one equation to know how many element is in a cir
Pointer1 = head; // (your node) count = 0; if( Pointer1 != NULL ) { count = 1; Pointer2 = Pointer1->Next; while ( Pointer2 != NULL && Pointer2 != Pointer1 ) { count++; Pointer2 = Pointer2->Next; } } return count;