以下函数为链队列的入队操作，x为要入队的结点的数据域的值，front、rear分别链队列的队头、队尾指针<p style="margin-left: 30px;">struct node<p style="margin-left: 30px;">{ ElemType data;<p style="margin-left: 30px;">struct node *next;<p style="margin-left: 30px;">};<p style="margin-left: 30px;">struct node *front，*rear;<p style="margin-left: 30px;">void InQueue(ElemType x)<p style="margin-left: 30px;">{<p style="margin-left: 30px;">struct node *p;<p style="margin-left: 30px;">p= (struct node*) malloc __(1)__; <p style="margin-left: 30px;">p->data=x; <p style="margin-left: 30px;">p->next=NULL; <p style="margin-left: 30px;"> __(2)__; <p style="margin-left: 30px;">rear= __(3)__; <p style="margin-left: 30px;">}选项3(matching)
.p

---