One Marks Questions1. Explain node structure of SLL. Answer: In any single linked list, the individual element is called as "Node".
Every "Node" contains two fields, data field, and the next field. The
data field is used to store actual value of the node and next field is
used to store the address of next node in the sequence.
The graphical representation of a node in a single linked list is as follows: In C, we achieve...