資料結構的觀念問題

1.In a (randomized) skip list with n entries the expected space complexity is O(n^2) 2.An edge in a graph is a self loop if it has the same end vertices. 3.A list-based queue takes O(n) time for dequeue() and enqueue() when the first element of the queue is implemented as the tail of the singly linked... 顯示更多 1.In a (randomized) skip list with n entries the expected space complexity is O(n^2)

2.An edge in a graph is a self loop if it has the same end vertices.

3.A list-based queue takes O(n) time for dequeue() and enqueue() when the first element of the queue is implemented as the tail of the singly linked list.

4.A list-based stack takes O(n) time for push(k) and pop() when the top of the stack is implemented as the tail of the singly linked list.

5.A “static” variable in Java is declared as a variable that is associated with an individual instance (object) of the class.

6.A graph consists of a set of vertices and a set of edges; both can be used to store elements.

想請教這五題是非題,因為我沒有答案,但自己觀念好像都不是很正確
故想請教各位高手

我是寫X O X X O O

第一題因為我沒學過,我看到有O(n)和O(n log n)的說法,想請教一下

第二題的self loop是不是就是指cycle呢?

第三、四題我不太懂 "implemented as the tail of the singly linked list."這邊的意思,請問這段話是什麼意思?

第五題我不太確定

第六題意思應該是 G = (V,E) 有一組頂點集合和邊集合,前面敘述應該是對的,但後面都可以用來存值的意思是??

不好意思 麻煩了,謝謝
3 個解答 3