COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Pointer to character
|
|
|
Pointer to integer
|
|
|
Pointer to node
|
|
|
Node
|
Detailed explanation-1: -A linked list consists of a data element known as a node. And each node consists of two fields: one field has data, and in the second field, the node has an address that keeps a reference to the next node.
Detailed explanation-2: -In linked list each node contain minimum of two fields.
Detailed explanation-3: -Every node in a linked list has two components: one to store the relevant information (the data); and one to store the address, called the link, of the next node in the list.
Detailed explanation-4: -In linked list each node contains a minimum of two fields. One field is data field to store the data second field is? Explanation: Each node in a linked list contains data and a pointer (reference) to the next node. Second field contains pointer to node.