假定一个带头结点的链式队列的队首和队尾指针分别为front和rear,每个结点结构由数据域data和指针域next组成 ,则将s所指结点入队所进行的操作为()。
A.rear=rear->next;
B.rear->next=s; rear=s;
C.s=rear;rear->next=s;
D.rear=s->next;s =rear;
A.rear=rear->next;
B.rear->next=s; rear=s;
C.s=rear;rear->next=s;
D.rear=s->next;s =rear;
A、front==rear && front !=null
B、front==rear
C、front==rear && rear !=null
D、front!=rear
A、front->next=p;front=p;
B、rear->next=p;rear=p;
C、p->next=rear;rear=p;
D、p->next=front;front=p;
A、front= =rear
B、front= =(rear+1)%(maxsize+1)
C、front= =(rear+1)% maxsize
D、front= =rear % maxsize
A、sq.front=(sq.front+1)%maxsize; x=sq.data[sq.front];
B、sq.front=sq.front+1; x=sq.data[sq.front];
C、sq.rear=(sq.rear+1)%maxsize; x=sq.data[sq.front];
D、sq.rear=sq.rear+1; sq.data[sq.front]=x;
A.front->next=s;front=s;
B.s->next=rear;rear=s;
C.rear->next=s;rear=s;
D.s->next=front;front=s;
为了保护您的账号安全,请在“简答题”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!