![](https://lstatic.shangxueba.com/sxbzda/h5/images/m_q_title.png)
![](https://lstatic.shangxueba.com/sxbzda/pc/images/home_logo.png)
![设线性表为(16, 20,26,24),以不带头结点的单向链表存储,链表头指针为head,以下程序的功能是](https://img2.soutiyun.com/shangxueba/askcard/2023-03/26/370/20230326090133794.jpg)
[主观题]
设线性表为(16, 20,26,24),以不带头结点的单向链表存储,链表头指针为head,以下程序的功能是
设线性表为(16, 20,26,24),以不带头结点的单向链表存储,链表头指针为head,以下程序的功能是
输出链表中各结点中的数据域data。struct node { int data;struct
node *next; };
typedef struct node NODE; #define
NULL 0 void main() { NODE *head,*p; p=head;
/*p为工作指针*/ do {
printf("%d/n",
}while();}
![](https://lstatic.shangxueba.com/sxbzda/h5/images/tips_org.png)