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
4
Answer:
tyyudfghgghhvgh sucks
Answered by
3
Explanation:
this is the answer to the question pls follow me
Attachments:
Similar questions
Math,
4 months ago
Chemistry,
4 months ago
Chemistry,
8 months ago
Math,
1 year ago
Social Sciences,
1 year ago