Circular single linked list, is this the right way to do it?

struct records t_head=0;

struct records *find_id(Rect a)
{

        struct records *tmp;
        struct records *prev;

	// Add first node
        if(t_head==NULL) {
        tmp=new records;
        tmp->b=a;
        tmp->id=trecord_count+1;
        tmp->tally.resize(labelsInfo.size());
        tmp->frames=0;
        t_head=tmp;
        t_head->next=NULL;
        trecord_count++;
        }

 	else {
	// Check if there is any node that has delete_flag set first
        tmp=t_head;
        while(tmp) {

        if(delete_flag) { 
      
        // Delete here
        if(tmp==t_head) {
        t_head=tmp->next;
        delete(tmp);
        trecord_count--;
	}
        else { 
        prev->next=tmp->next;
        delete(tmp);
        trecord_count--;
        }
       
        }

        prev=tmp;
        tmp=tmp->next;
        }

	
        tmp=new records
        tmp->b=a;
        tmp->id=trecord_count+1;
        tmp->tally.resize(labelsInfo.size());
        tmp->frames=0;
        tmp->next=t_head;
        t_head=tmp;
        trecord_count++;
        }

        return tmp;
}