(48)～(50)以下程序的功能足：建立一个带有头结点的甲—向链表，并将存储在数组中的字符依次转存到链表的各个结点中，请从与下划线处号码对应的一组选项中选择出正确的选项。
#include ＜stdlib.h＞
struct node
char data; struct node *next: ;
(48) CreatList(char *s)
struct node *h,*p,*q;
h = (struct node *)malloc sizeof(struct node));
p=q=h;
while(*s! =’\0’)
p = (struct node *)malloc(sizeof (struct node));
p-＞data = (49) ;
q-＞next = p;
q - (50) ;
S++;
p-＞next=’\0’;
return h;
main()
char str[]="link list";
struct node *head;
head = CreatList(str);
A．p-＞next
B．p
C．s
D．s ＞next
