A circular linked list is characterized by:Group of answer choicesEach node pointing to itselfIt is a singly linked listEach node has two pointers: next and previousThe last node pointing to the first node

What is a circular linked list?A linked list where the last node points to None.A linked list where each node points to the previous and the next node.A linked list where there is a loop in the list.A linked list where each node points to the next node, and the last node points to the first node.

What is meant by circular linked list? Write an algorithmto insert a node at the end in a circular linked list.1 2 3

n a singly linked list, each node stores:Group of answer choicesData onlyData and pointers to the next and previous nodesData and a pointer to the next nodePointers to the next and previous nodes only

Which type of linked list has its last node pointing back to the first node?a.Singly linked listb.Circular linked listc.Linear linked listd.Doubly linked list

class Node {int data;Node* prev;Node* next;}; What does the above code represent :A. Represent node/element in a doubly linked listB. Represent node/element in circular doubly linked listGroup of answer choicesA and Bonly ANoneOnly B PreviousNext