Computer Science, asked by shanmukasunny333, 8 months ago

Which of the following is false about a circular linked list?
A
Every node has a successor
B
Time complety of inserting a new node at the head of the list is O(1)
C
Time compledty for deleting the last node is O(n)
D
We can traverse the whole circular linked list by starting from any point
ОА
OB
Ос
Oo​

Answers

Answered by manishtete21
4

Answer:

tyyudfghgghhvgh sucks

Answered by sridhar66
3

Explanation:

this is the answer to the question pls follow me

Attachments:
Similar questions