Two-way cyclic chain list practice

Watch the Little Turtle Video:

Requires a user to enter a number to make 26 letters change, such as input 3 output results:

Defghijklmnopqrstuvwxyzabc

Output-3 Get Results

Xyzabcdefhijklmnopqrstuvw

#include <stdio.h> #include <stdlib.h> #define OK 1 #define ERROR 0 typedef char Elemtype;

typedef int STATUS;
	typedef struct DUALNODE {elemtype data;
	struct Dualnode *prior;
struct Dualnode *next;

}dualnode,*dulinklist;
	Status initlist (dulinklist *l) {Dualnode *p,*q;

	int i;
	*l = (dulinklist) malloc (sizeof (Dualnode)); if (! (
	*l) {return ERROR;

	} (*l)->next = (*l)->prior;//(*L)->next= null:p = (*l);
		for (i=0;i<26;i++) {q = (Dualnode *) malloc (sizeof (Dualnode));
		if (!q) {return ERROR;
		} q->data = ' A ' +i;
		Q->prior = p;
		Q->next = p->next;//equal Q->next = NULL;
		P->next = q;
	p = q;
	} P->next = (*l)->next;

	(*l)->next->prior = p;
return OK;
		} void Caesar (Dulinklist *l,int i) {if (i>0) {do {(*l) = (*l)->next; 
	}while (i.);
		} if (i<0) {do {(*l) = (*l)->next;
	}while (++i);
	}} int main () {dulinklist L;

	int i,n;
	Initlist (&AMP;L); printf ("Enter a numbER: ");

	scanf ("%d", &n);
	
	Caesar (&l,n);
		for (i=0;i<26;i++) {l=l->next;
	printf ("%c", l->data);

	} printf ("\ n");
return 0;
 }