COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
4
|
|
|
3
|
|
|
1
|
|
|
2
|
Detailed explanation-1: -In a singly-linked list, each node contains one item of data and one pointer.
Detailed explanation-2: -In a doubly linked circular linked list, each node has pointers that point to both the next node and the previous node.
Detailed explanation-3: -The doubly linked list node accomplishes this in the obvious way by storing two pointers: one to the node following it (as in the singly linked list), and a second pointer to the node preceding it.
Detailed explanation-4: -Singly Linked Lists: Each node contains only one pointer to the next node. This is what we have been talking about so far. Doubly Linked Lists: Each node contains two pointers, a pointer to the next node and a pointer to the previous node.
Detailed explanation-5: -In C language, a linked list can be implemented using structure and pointers . struct LinkedList int data; struct LinkedList *next; ; The above definition is used to create every node in the list. The data field stores the element and the next is a pointer to store the address of the next node.