00:01
Hello students, as the first answer is the option a, option a that is the circular singly linked list, that is the circular singly linked list, linked list.
00:22
When in a circle, a circular singly linked list, the last node's pointer points back to the first node forming a circular structure.
00:32
Each node contains a pointer to the next node, but there is no backward link from the node to its previous node.
00:40
So for the second one, dash is not an advantage of this linked list when compared to array that is option c, directed access to any list, direct access to any list element, any list element.
01:05
So as linked list do not provide a direct access to any list element like array do, so in linked list, accessing an element requires traversing the list from the beginning, starting from the head or the tail, so depending on the type of the linked list.
01:26
For the third question, when a new node is inserted to the head of the linked list, will the head pointer and the tail pointer will be changed? the option is b, the option is b.
01:40
If the linked list is not empty after the insertion, head will change.
01:44
So it is option b.
01:46
If the list is not empty, it is not empty before the insertion, before the insertion, so the head will change, head will change.
02:13
When a new node is inserted at the head of the linked list, the newly added node becomes the new head and its pointer points to the previous head.
02:22
The tail pointer will not change as a new node is added at the front, not at the end of the list...