皮皮学，免费搜题
登录
搜题
【单选题】
Consider an implementation of unsorted singly linked list. Suppose it has representation which a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? (I). Insertion at the front of the linked list. (II). Insertion at the end of the linked list. (III). Deletion of the front node of the linked list. (IV). Deletion of the last node of the linked list.A.
I and II
B.
I and III
C.
I, II, and III
D.
I, II, and IV
手机使用
分享
复制链接
新浪微博
分享QQ
微信扫一扫
反馈参考答案：
举一反三
【简答题】请用∈， ， 填下列空格： {a}______{{a}，3，4，1}； {a，4，{3}}______{2，a，{3}，4}； {{a}}______{{a}，3，4，1}．
【单选题】It is time now to learn ________ to protect our atmosphere, the roof over the world of man.
A.
what
B.
which
C.
how
D.
that
【简答题】由下图填空： （1）∠AOC=________+________； （2）∠AOC-∠AOB=________； （3）∠COD=∠AOD-________； （4）∠BOC=________-∠COD； （5）∠AOB+∠COD=________-________。
参考解析：
知识点：
题目纠错 0
发布
