## Discussion Forum

Que. | Which of the following is false about a circular linked list? |

a. | Every node has a successor |

b. | Time complexity of inserting a new node at the head of the list is O(1) |

c. | Time complexity for deleting the last node is O(n) |

d. | None of the mentioned |

Answer:Time complexity of inserting a new node at the head of the list is O(1) |