[填空題] 下面程序的功能是建立一個(gè)有3個(gè)結(jié)點(diǎn)的單循環(huán)鏈表，然后求各個(gè)結(jié)點(diǎn)數(shù)值域data中數(shù)據(jù)的和，請(qǐng)?zhí)羁铡?/p>

#include ＜stdio.h＞

#include ＜stdlib.h＞

struct NODE int data;

struct NODE *next; ;

void main()

struct NODE *p,*q,*r;

int sum=0;

p=(struct NODE *)malloc(sizeof(struct NODE));

q=(struct NODE *)malloc(sizeof(struct NODE));

r=(struct NODE *)malloc(sizeof(struct NODE));

p-＞data=100;q-＞data=200;r-＞data=300;

p-＞next=q; q-＞next=r;r-＞next=p;

sum=p-＞data+p-＞next-＞data+r-＞next-＞next-＞______:

printf("%d", sum);

-＞next-＞data