【判断题】【消耗次数：1】
顺序表的每个结点只能是一个简单类型，而链表的每个结点可以是一个复杂类型。
①
正确
②
错误
参考答案：
复制
纠错
相关题目
【单选题】
在一个尾指针为rear的不带头结点的单循环链表中,插入一个s所指的结点,并作为第一个结点，可执行( ).
①
A.rear?next=s;s?next=rear?next
②
B.rear?next=s?next;
③
C.rear=s?next
④
D．s?next=rear?next ; rear?next=s;
随机题目
【单选题】
Can you go to the concert with us this evening?____________
①
No, I already have plans.
②
I’d love to, but I’m busy tonight.
③
No, I really don’t like being with you.
④
I’m ill, so I shouldn’t go out.
【单选题】
Havent seen you for ages. Lets have a dinner together this weekend.____________
①
Yes, of course.
②
Welcome!
③
No, thanks.
④
Great idea!
【单选题】
I was satisfied with her explanation, ______.
①
so my classmates were
②
so were my classmates
③
so my classmates did
④
so did my classmates
【单选题】
A kind teacher always takes a very _______ attitude when correcting students’ mistakes.
①
negative
②
partial
③
potential
④
positive